Fundamental Algorithms

This website demonstrates the fundamental algorithms of computer science, along with their pseudocode A high-level description of an algorithm, not relating to any specific programming language. and complexity The amount of time taken to execute an algorithm (time complexity), measured in Big-O.


Sorting

> Selection Sort
> Insertion Sort
> Bubble Sort
> Quick Sort
> Merge Sort
> Shell Sort
> Radix Sort
> Heap Sort

Searching

> Sequential Search
> Binary Search
> Binary Search Tree
> Interpolation Search
> Hashing

Selection Sort

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Quisque imperdiet odio est, sit amet suscipit leo ornare eget. Ut auctor eleifend eleifend. Vestibulum ac convallis sem.

Random

Nearly Sorted

Reversed

Few Unique

play_arrow
00:00

Insertion Sort

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Quisque imperdiet odio est, sit amet suscipit leo ornare eget. Ut auctor eleifend eleifend. Vestibulum ac convallis sem.

Random

Nearly Sorted

Reversed

Few Unique

play_arrow
00:00

Bubble Sort

Bubble Sort is a very simple sorting algorithm that works by iterating over an array 2 elements at a time, swapping them if they're in the wrong order. It terminates when a loop is completed with no swaps.

Random

Nearly Sorted

Reversed

Few Unique

play_arrow
00:00

Quick Sort

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Quisque imperdiet odio est, sit amet suscipit leo ornare eget. Ut auctor eleifend eleifend. Vestibulum ac convallis sem.

Random

Nearly Sorted

Reversed

Few Unique

play_arrow
00:00

Merge Sort

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Quisque imperdiet odio est, sit amet suscipit leo ornare eget. Ut auctor eleifend eleifend. Vestibulum ac convallis sem.

Random

Nearly Sorted

Reversed

Few Unique

play_arrow
00:00

Shell Sort

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Quisque imperdiet odio est, sit amet suscipit leo ornare eget. Ut auctor eleifend eleifend. Vestibulum ac convallis sem.

Random

Nearly Sorted

Reversed

Few Unique

play_arrow
00:00

Radix Sort

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Quisque imperdiet odio est, sit amet suscipit leo ornare eget. Ut auctor eleifend eleifend. Vestibulum ac convallis sem.

Random

Nearly Sorted

Reversed

Few Unique

play_arrow
00:00

Heap Sort

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Quisque imperdiet odio est, sit amet suscipit leo ornare eget. Ut auctor eleifend eleifend. Vestibulum ac convallis sem.

Random

Nearly Sorted

Reversed

Few Unique

play_arrow
00:00

Sequential Search

Binary Search

Binary Search Tree

Interpolation Search

Hashing

This page is best viewed on a computer.