ViewTube

Full course — free exercises, summary notes, and AI-graded feedback: https://ludium.ai/courses/intro-cs-python Selection sort ...

You wrote these in the comments, so I built them: extinction sort, sortbogo, mathematical redefinition sort, the bag of sorts and the ...

Sorting a million numbers by comparing every pair takes about 500 billion comparisons. Merge sort does it in about 20 million.

In 2011 someone on 4chan posted a sort that never compares anything: each number just sleeps for that many seconds. People ...

Four lines of code: for every i, for every j, if A[i] is less than A[j], swap. The comparison looks backwards and the loops look sloppy, ...

Binary search needs a sorted list. So how do we sort one? Let's start with the simplest sorting algorithm of all: bubble sort.

Jeffrey has a thousand exam papers to sort. The obvious way takes almost half a million comparisons. So he splits the pile in half ...

Bubble Sort is the algorithm almost every programmer meets first, and in this video you watch every single comparison and swap ...

The worst sorting algorithms, raced on one fair scoreboard: Stalin Sort, Sleep Sort, Stooge Sort, Slowsort, Bozosort, Permutation ...

Bubble, selection and insertion sort are all O(N²): slow for big lists. Today we use recursion to build something much faster.