Algo-1

The first edition of the algo course in Hack Bulgaria

Partners

The course is happening thanks to:

Course Program

The topics that we cover at the Algorithms course.

Lecture 1 - Intro, analysis and data structures

• 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

Lecture 2 - Sorting

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

Lecture 3 - Searching

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

Lecture 4 - Binary trees

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

To be discussed

• Trees & Tree-like data structures (1 lecture)
  • Trie
  • Indexed tree
• Graphs (3 lectures)
  • adjacency list
  • adjacency matrix
  • BFS / DFS
  • Spanning trees
    • Minimum spanning trees - Prim and Kruskal
  • Shortest path
    • Dijkstra
    • Floyd–Warshall
  • Topological sorting
• Hashing (1 lecture)
  • Hash function
  • Hash table
  • Bloom filter
• String algorithms (1 lecture)
  • rolling hash
  • run-length encoding
  • Burrows-Wheeler transform
  • Knuth-Morris-Pratt
• Randomized algorithms - Monte Carlo and Las Vegas (3 lecture)
• Dynamic programming (3 lecture)