56 lines
1.2 KiB
Plaintext
56 lines
1.2 KiB
Plaintext
Make sure everything is implemented and tested.
|
|
|
|
General housekeeping:
|
|
Tidy-up the codebase, mainly make the code's style consistent in all the project.
|
|
Write docs.
|
|
|
|
TESTS:
|
|
1) Check the tests for queue.
|
|
|
|
Debug the tests for the binary search function.
|
|
|
|
Future goals:
|
|
Implement more data structures, such as hash tables, hash maps, more trees.
|
|
Implement algorithms to go with said DSs.
|
|
Implement generic algorithms (start from sort and search).
|
|
Allow compilation with tcc instead of/in addition to gcc.
|
|
|
|
Write documentation, some of it needs revisiting and filling out (I.E.: it is only partly-done).
|
|
|
|
Currently implemented:
|
|
|
|
Data Structures:
|
|
Single node.
|
|
Double linked node.
|
|
Tree node.
|
|
Linked list.
|
|
Double linked list.
|
|
Stack.
|
|
Binary Tree.
|
|
BST - Binary Search Tree.
|
|
Queue (Implementation written, just needs testing).
|
|
|
|
Algorithms:
|
|
Safe string copy.
|
|
Bubble Sort (fix warning + improve tests).
|
|
Quicksort.
|
|
Binary Search (in a sorted array).
|
|
|
|
|
|
To be implemented:
|
|
Merge Sort.
|
|
Introspective sort (Uses both quicksort and merge sort).
|
|
Heap.
|
|
Heapsort (after implementing heaps).
|
|
Insertion sort.
|
|
Hashmap.
|
|
AVL trees.
|
|
Red-Black trees.
|
|
AA Trees (?).
|
|
Circular buffer (?).
|
|
Array list (?).
|
|
Dynamic array/vector.
|
|
|
|
Misc tasks:
|
|
None!
|