Hey, eventhough I write code everyday to solve practical problems, algorithms appear to be a different game.
It's time I sharpen up my algorithm skills by taking different tests. I'm documenting them here.
- BinaryGap
- InsertionSort (Integer data types)
- MergeSort (Integer data types)
- HeapSort
- QuickSort (Integer data types)
- Depth First Search Traversal
- Breadth First Search Traversal
- Add more test cases for BinaryGap and DecimalToBaseX functions
- Add test to cover traverseNode function in DFS implementation
- Add comments to explain logic. Right now I think if I come back to this, I would remember what I did, but don't we all always feel that way ¯_(ツ)_/¯
- Add test for heapifyMax function in HeapSort