Learning Overview

Sorting

Bubble Sort

A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them

Quick Sort

An efficient divide-and-conquer sorting algorithm with O(n log n) average time complexity

Merge Sort

Divides the array into two halves, sorts them separately and merges them back together

Insertion Sort

Builds the sorted array one item at a time by inserting each element into its proper position

Search

Binary Search

Search algorithm for finding an element in a sorted array with O(log n) time complexity

Linear Search

Sequential search algorithm that traverses the array from beginning to end

Depth-First Search

Graph and tree traversal algorithm that explores as far as possible along each branch

Breadth-First Search

Graph and tree traversal algorithm that visits nodes level by level

Graph

Dijkstra Algorithm

Greedy algorithm for finding the shortest path from a single source

Floyd-Warshall

Dynamic programming algorithm for finding shortest paths between all pairs of vertices

Kruskal Algorithm

Greedy algorithm for finding the minimum spanning tree

Dynamic Programming

Fibonacci Sequence

Classic introductory problem for dynamic programming

Knapsack Problem

Classic problems including 0-1 knapsack and unbounded knapsack

Longest Common Subsequence

Find the longest subsequence common to two sequences