Data structure and algorithms in c
- โ Linear search(./linear_search/linear_search.c)
- โ Binary search
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Radix Sort
- Arrays
- Linked lists
- Stacks
- Queues
- Heap
- Trees(Binary Trees, BST,..etc)
- Graphs
- Hash Tables
- AVL Trees
- Red-Black Trees
- Trie
- Segment Tree
- Fenwick Tree (Binary Indexed Tree)
- Disjoint Set (Union-Find)
- Recursion
- Divide and Conquer
- Dynamic Programming
- Greedy Algorithms
- Backtracking
- Depth First Search (DFS)
- Breadth First Search (BFS)
- Dijkstra's Algorithm
- Bellman-Ford Algorithm
- Kruskal's Algorithm
- Prim's Algorithm
-
Naive search
-
KMP
-
Boyer moore
-
Longest Common Subsequence (LCS)
-
Longest Increasing Subsequence (LCS)
- Bitwise AND,OR,XOR
- Bitwise Shits
- Counting Set Bits
- Finding the Single Non-Repeated Element
- Solve algorithmic problems on online platforms(e.g., LeetCode, HackerRank)
- Implement data structures and algorithms from scratch
- Participate in coding contests
- Time and space complexity Analysis
- Big-O Notation
- Understand and implement common algorithmic patterns