Algorithms

This section details some of the most useful algorithms and data structures.

SubPages

• Binary Search: How to use the binary search algorithm.
• Bubble Sort: How the bubble sort works
• Insertion Sort: How the insertion sort works
• Selection Sort: How the selection sort works
• Quick Sort: How the quick sort works
• Merge Sort: How the merge sort works
• Linked List: Use a linked list for O(1) append, push, or pop operations.
• Queue: Use queues for faster push and pop operations.
• Stack: Use a stack for LIFO operations.
• Set: Use a set to quickly check for existence.
• Heap Datastructure: The heap structure explained.
• AVL Tree: A binary search tree that stays balanced.
• Radix: The radix tree
• More Algorithms: Algorithms to cover later.