Algorithms Overview

Step-by-step procedures to solve problems.

Categories

Sorting

• Quick Sort - Divide-and-conquer
• Merge Sort - Stable sorting
• Heap Sort - In-place sorting

Searching

• Binary Search Implementation Variations - Logarithmic search
• Binary Search Tasks - logarithmic search
• Linear Search - Sequential search

Graphs

• Dijkstra's Algorithm - Shortest path
• BFS/DFS - Graph

Maths

• Generating Functions Practise Tasks - Maths section
• Generating Functions Theory - Maths section

Analysis

Every algorithm includes: - Time Complexity: Runtime scaling - Space Complexity: Memory usage - Best/Average/Worst Case: Scenarios

Explore specific algorithms from the menu!