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 (done by @Harshita)
 Golden section search (assigned to @ankursanodiya)
 Fuzzy search (assigned to @gautamaggrawal)
 Interpolation search
 Jump search
 Fractional cascading in Binary search
 Noisy binary search
Sorting algorithms
 Bead sort
 Bogo sort
 Bubble sort
 Bucket sort (done by @Saranyajena)
 Circle sort (assigned to @ankursanodiya)
 Comb sort (done by @shreyasingh)
 Counting sort
 Cycle sort (done by @Robotjelly123)
 Flash sort
 Gnome sort
 Heap sort (done by @arunkumar0258)
 Insertion sort
 Binary Insertion sort
 Intro sort (assigned to @Saranyajena)
 Median sort
 Merge sort
 Pigeonhole sort (assigned to @Harshita)

Quick sort
 Median of medians (assigned to @shreyateeza)
 Quantum Bogo Sort
 Radix sort (done by @Robotjelly123)
 Selection sort
 Shaker sort
 Shell sort
 Shell Metzner sort
 Sleep sort (assigned to @la27)
 Stooge sort (assigned to @ankursanodiya)
 Topological sort using Depth First Search (done by @Saranyajena)
 Topological sort using Breadth First Search
 Tree sort
 Odd even sort (assigned to @Harshita)
Graph algorithms
 Hamiltonian cycle (assigned to @TravellerOnCode)
 Hamiltonian path (assigned to @Harshita)
 Clique in graphs
 clique (assigned to @saddhu1005)
 Bron Kerbosch algorithm (assigned to @saddhu1005)
 Greedy approach to find the single maximal clique (assigned to @saddhu1005)
 Algorithm to find cliques of a given size k (assigned to @saddhu1005)
 Minimum cut
 Karger cut
 Maximum matching
 Assignment problem
 Hopcroft Karp algorithm (assigned to @saddhu1005)
 Blossom algorithm (assigned to @saddhu1005)
 Hungarian algorithm (assigned to @saddhu1005)
 Hall marriage theorem
 Konig theorem
 Peterson theorem
 Shortest path with k edges (assigned to @saddhu1005)
 Tarjan algorithm (Strongly connected components) (done by @pradyumn014)
 Kosaraju’s algorithm (Strongly connected components) (assigned to @r0uxt1)
 Centroid decomposition (assigned to @saddhu1005)
 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 @nisarg1499)
 Minimum spanning tree
 Bipartite check (assigned to @ishagautam)
 Dials algorithm (Optimised Dijkstra’s algorithm) (assigned to @nisarg1499)
 Farach Colton and Bender algorithm (assigned to @siddharth)
 find the mother vertex in a graph (assigned to @phm_123)
 finding the paths between two vertexes in a graph (assigned to @phm_123)
Computational geometry
 2D line intersection
 2D separating axis test
 Area of polygon (assigned to @piyush26c)
 Area of triangle (assigned to @piyush26c)
 Axis aligned bounding box collision
 Bresenham line (done by @piyush26c)
 Bresenham circle drawing algorithm (done by @piyush26c)
 Chans algorithm
 Cohen sutherland line clipping algorithm
 Sutherland Hodgeman algorithm
 Distance between two points (assigned to @piyush26c)
 Half plane intersection
 Sphere Tetrahedron Intersection
 Convex Hull
 Warnock algorithm
Dynamic programming
 Subset with sum divisible by m (assigned to @GeniGaus)
 Longest repeated subsequence (assigned to @Vaibhav)
 Maximum sum bitonic subsequence
 Tile Stacking Problem (assigned to @saddhu1005)
 Number of ways to form a heap with n distinct integers
 Ways to write n as sum of two or more positive integers (assigned to @sajal_tikariha)
 Longest Arithmetic Progression (assigned to @sajal_tikariha)
 Unbounded Knapsack Algorithm (assigned to @masters_abh)
 Coin change problem
 Subset sum problem (assigned to @ishagautam)
 Assembly Line Scheduling (assigned to @karna98)
 Edit distance problem (assigned to @rajashree23)
 Cutting a Rod to maximize profit (1D DP) (assigned to @startech)
 number of paths with k edges in a graph (dynamic programming + divide conquer) (assigned to @saddhu1005)
 vertex cover problem (assigned to @saddhu1005)
 word break problem (assigned to @saddhu1005)
[add your list]
Greedy algorithms
 Minimum product subset in an array (assigned to @r0uxt1)
 Maximum product subset in an array (assigned to @r0uxt1)
 Divide 1 to n into two groups with minimum sum difference (assigned to @r0uxt1)
 Split n into maximum composite numbers
 Maximize the sum of arr[i]*i
 Minimum sum of products of two array (assigned to @aryabharat)
 Largest lexicographic array with atmost K consecutive swaps (assigned to @r0uxt1)
 Smallest subset with sum greater than all other elements
 Activity Selection problem (assigned to @shreyasingh)
 Job sequencing problem (assigned to @masters_abh)
 Fractional Knapsack Problem (assigned to @shreyasingh)
 Huffman Coding (assigned to @dldisha)
 Minimum swaps for bracket balancing (assigned to @Vaibhav)
 Find the minimum number of platforms needed in the station to avoid any delay in arrival of any train (assigned to @Vaibhav)
[add your list]
Others
 Square root Decomposition
 Euclidean GCD algorithm (assigned to @arunesh)
 Minimum insertion to make shortest palindrome (@mishramonalisha76)
 Multiple array range increments in linear time (assigned to @r0uxt1)
 Binary Lifting and LCA (assigned to @arshad2117)
 Heap’s algorithm for generating permutations (assigned to @piyush26c)
 Zalgorithm (assigned to @shubhammantri1)
 word break Problem using backtracking and Trie (assigned to @saddhu1005)
 maximum subarray sum using divide and conquer (assigned to @akshay_103)
 Smallest common supersequence (assigned to @saddhu1005)
[Add your topic]