Algo-I_codes

Repository containing all the programs covered in the Algorithm-I class.

Topics:

(* No code available)

Divide and Conquer
- Strassen's Matrix Multiplications
- Maximum Subarray Problem
- Karatsuba Big Integer Multiplication
- Closest Point Pair
Sorting
- Insertion sort
- Merge Sort
- Heap Sort (and Priority Queues)
- Quick Sort
- Count & Radix Sort
- Bucket Sort *
- Kth Smallest Element
Hashing
- Direct Address Tables *
- Hash tables *
- Chaining *
- Open Addressing *
  - Linear Probing
  - Quadratic Probing
  - Double Hashing
Trees
- Binary Search Trees
  - Traversal(inorder, preorder, postorder)
  - Inorder Succesor
  - Search, Insertion, Deletion
- RBT
  - Left and Right Rotation
  - Insertion
Dynamic Programming
- Matrix-chain Multiplication
- Longest Common Subsequence
- Weighted Activity Selection
- O-1 Knapsack
Greedy
- Activity Selection
- Fractional Knapsack