lectures.alex.balgavy.eu

Lecture notes from university.
git clone git://git.alex.balgavy.eu/lectures.alex.balgavy.eu.git
Log | Files | Refs | Submodules

_index.md (1184B)

      1 +++
      2 title = "Data Structures & Algorithms"
      3 +++
      4 
      5 # Data Structures & Algorithms
      6 
      7 [Big O cheat sheet for speedy memorisation.](http://www.bigocheatsheet.com/)
      8 
      9 Course notes:
     10 
     11 1. [Course information](course-information)
     12 
     13 2. [Algorithms - general](algorithms-general)
     14 
     15 3. [Sorting algorithms](sorting-algorithms)
     16 
     17     - [Insertion sort](insertion-sort)
     18     - [Merge sort](merge-sort)
     19     - [Quicksort](quicksort)
     20     - [Heapsort](heapsort)
     21     - [Linear-time algorithms](linear-time-algorithms)
     22 
     23 4. Linear data structures
     24 
     25     - [Stack](stack)
     26     - [Queue & Priority queue](queue)
     27     - [Linked list](linked-list)
     28 
     29 5. [Hashing & hash tables](hashing)
     30 
     31 6. [Binary search trees & AVL](binary-search-avl-trees)
     32 
     33 7. [Dynamic programming:](dynamic-programming)
     34 
     35     - [Fibonacci numbers](fibonacci-numbers)
     36     - [Max subarray](max-subarray)
     37     - [Knapsack01](knapsack01)
     38     - [Rod cutting](rod-cutting)
     39     - [Longest common subsequence](longest-common-subsequence)
     40 
     41 8. [Greedy algorithms](greedy-algorithms)
     42 
     43     1. [Make change](greedy-algorithms)
     44 
     45     2. [Activity selection](activity-selection)
     46 
     47     3. [Fractional knapsack](fractional-knapsack)
     48 
     49     4. [Huffman codes](huffman-codes)