This is a task list focused on Algorithm topics for OpenGenus IQ and Cosmos

See this guide to understand how to use this task list. Message @aditya if you need any help. You may work on uncompleted tasks, improve existing work and add questions for a completed task. See published posts here

Following is a small collection of scopes you may contribute to:

### Search algorithms

- Linear search
- Binary search
- Ternary search
- Exponential search
- Fibonacci search (assigned to @Harshita)
- Fuzzy search (assigned to @AkshitAggarwal)
- Interpolation search
- Jump search
- Fractional cascading in Binary search
- Noisy binary search

### Sorting algorithms

- Bead sort
- Bogo sort
- Bubble sort
- Bucket sort (done by @Saranya-jena)
- Circle sort (assigned to @raghav-dalmia)
- Comb sort (assigned to @shreya-singh)
- Counting sort (assigned)
- Cycle sort (assigned to @Robotjelly123)
- Flash sort
- Gnome sort
- Heap sort (assigned to @arunkumar0258)
- Insertion sort
- Binary Insertion sort
- Intro sort
- Median sort
- Merge sort
- Pigeonhole sort
- Quick sort
- Quantum Bogo Sort
- Radix sort (assigned to @Robotjelly123)
- Selection sort
- Shaker sort
- Shell sort
- Sleep sort
- Stooge sort
- Topological sort (assigned to @Saranya-jena)
- Tree sort

### Graph algorithms

- Hamiltonian cycle (assigned to @abhishalya)
- Hamiltonian path
- Bron Kerbosch algorithm
- Minimum cut
- Karger cut

- Maximum matching
- Assignment problem
- Hopcroft Karp algorithm
- Blossom algorithm
- Hungarian algorithm
- Hall marriage theorem
- Konig theorem
- Peterson theorem

- Shortest path with k edges
- Tarjan algorithm (Strongly connected components) (assigned to @pradyumn014)
- Centroid decomposition (assigned to @kamilla0503)
- Depth first search
- Breadth first search
- Shortest path algorithms:
- Bellman ford algorithm
- Dijkstra’s Algorithm
- Floyd–Warshall’s Algorithm
- Shortest path faster algorithm
- Johnson algorithm (assigned to @Aishwarya)

- Minimum spanning tree
- Bipartite check (assigned to @isha-gautam)

### Computational geometry

- 2D line intersection
- 2D separating axis test
- Area of polygon
- Area of triangle
- Axis aligned bounding box collision
- Bresenham line (assigned to @piyush26c)
- Bresenham circle drawing algorithm (done by @piyush26c)
- Chans algorithm
- Cohen sutherland line clipping algorithm
- Sutherland Hodgeman algorithm
- Distance between two points
- Half plane intersection
- Sphere Tetrahedron Intersection
- Convex Hull
- Warnock algorithm

### Dynamic programming

- Unbounded Knapsack Algorithm (assigned to @masters_abh)
- Coin change problem
- Subset sum problem (assigned to @isha-gautam)

[add your list]

### Greedy algorithms

- Activity Selection problem (assigned to @shreya-singh)
- Job sequencing problem (assigned to @masters_abh)
- Fractional Knapsack Problem (assigned to @shreya-singh)

[add your list]

### Others

- Square root Decomposition (assigned to @shubhampaliwal95)
- Euclidean GCD algorithm (assigned to @arunesh)