The first edition of the algo course in Hack Bulgaria

The course is happening thanks to:

The topics that we cover at the Algorithms course.

• Course introduction
• Algorithm analysis
  • Execution instructions
  • Asymptotic analysis
  • Algorithm complexity and Big Oh notation
  • Best/wrost case analysis
• Linear data structures
  • Array
  • List
  • Vector
  • Queue/Stack

• Selection sort
• Insertion sort
• Merge sort
• Bubble sort
• Shell sort
• Quick sort
• Counting sort

• Linear search
• Binary search
  • Different data types - integers/floats
  • Different structures - arrays/range of numbers
• Ternary search
• Interpolation search

• Binary tree
• Binary search tree
• Binary Heap
• Heap sort
• Priority queue

• Binary Indexed Tree

• Graph
• Graph properties
• Graph representations
• Graph traversals

• Trees & Tree-like data structures
  • Trie
• Graphs
  • Spanning trees
    • Minimum spanning trees - Prim and Kruskal
  • Shortest path
    • Dijkstra
    • Floyd–Warshall
  • Topological sorting
• Hashing
  • Hash function
  • Hash table
  • Bloom filter
• String algorithms
  • rolling hash
  • run-length encoding
  • Burrows-Wheeler transform
  • Knuth-Morris-Pratt
• Randomized algorithms - Monte Carlo and Las Vegas
• Dynamic programming