Clean implementation in C
There is a list of finished implementations. I keep working on new ones.
- Linked List (Vector)
- Linked List
- Doubly Linked List
- Stack (Linked)
- Stack (Vector)
- Queue (Linked)
- Queue (Vector)
- Binary Tree
- Bubble Sort
- Insertion Sort
- Gnome Sort
- Shake Sort
- Count Sort
- Selection Sort
- Shell Sort
- Heap Sort
- Quick Sort
- Merge Sort
- Radix Sort (Count)
- Linear Search
- Binary Search
- Jump Search
- Linear Search in String
- KMP Search
- Boyer-Moore Search
I would be happy if you are leave a comment, issues, ways to improvement