Examples of Sorting Algorithms

?

?# Keyboard Navigation

## Global Keys

[, < / ], > Jump to previous / next episode

W, K, P / S, J, N Jump to previous / next marker

t / T Toggle theatre / SUPERtheatre mode

V Revert filter to original state Y Select link (requires manual Ctrl-c)## Menu toggling

q Quotes
r References
f Filter
y Link
c Credits
## In-Menu Movement

## Quotes and References Menus

Enter Jump to timecode

## Quotes, References and Credits Menus

o Open URL (in new tab)
## Filter Menu

x, Space Toggle category and focus next

X, ShiftSpace Toggle category and focus previous

v Invert topics / media as per focus## Filter and Link Menus

z Toggle filter / linking mode
## Credits Menu

Enter Open URL (in new tab)

W, K, P / S, J, N Jump to previous / next marker

t / T Toggle theatre / SUPERtheatre mode

V Revert filter to original state Y Select link (requires manual Ctrl-c)

a

w

s

s

d

h
j
k
l

←

↑

↓

↓

→

X, ShiftSpace Toggle category and focus previous

v Invert topics / media as per focus

⏫

Previous: 'Order Notation'

⏫

0:08Share a link from yesterday's chat^{1}

0:08Share a link from yesterday's chat^{1}

0:08Share a link from yesterday's chat^{1}

1:54Blackboard: Problem "difficulty" scale

1:54Blackboard: Problem "difficulty" scale

1:54Blackboard: Problem "difficulty" scale

12:59Blackboard: Travelling Salesman Problem

12:59Blackboard: Travelling Salesman Problem

12:59Blackboard: Travelling Salesman Problem

22:37Thank Longboolean for the link

22:37Thank Longboolean for the link

22:37Thank Longboolean for the link

24:17Blackboard: Sorting

24:17Blackboard: Sorting

24:17Blackboard: Sorting

24:53handmade_render_group.cpp: Note that the current SortEntries function is O(n^2)

24:53handmade_render_group.cpp: Note that the current SortEntries function is O(n^2)

24:53handmade_render_group.cpp: Note that the current SortEntries function is O(n^2)

25:17Blackboard: Reiterate why we don't care about adding the n in Order Notation

25:17Blackboard: Reiterate why we don't care about adding the n in Order Notation

25:17Blackboard: Reiterate why we don't care about adding the n in Order Notation

26:56Blackboard: Scaling only matters if you actually scale!

26:56Blackboard: Scaling only matters if you actually scale!

26:56Blackboard: Scaling only matters if you actually scale!

29:55Debugger: Break into SortEntries and inspect the Count

29:55Debugger: Break into SortEntries and inspect the Count

29:55Debugger: Break into SortEntries and inspect the Count

30:39Blackboard: The relevance of scale

30:39Blackboard: The relevance of scale

30:39Blackboard: The relevance of scale

32:57Blackboard: "Worse case"

32:57Blackboard: "Worse case"

32:57Blackboard: "Worse case"

34:54Blackboard: Why the default sort in the CRT is quicksort

34:54Blackboard: Why the default sort in the CRT is quicksort

34:54Blackboard: Why the default sort in the CRT is quicksort

37:16Blackboard: More sorts

37:16Blackboard: More sorts

37:16Blackboard: More sorts

39:53Blackboard: The expected running times for these sorts in the worst case

39:53Blackboard: The expected running times for these sorts in the worst case

39:53Blackboard: The expected running times for these sorts in the worst case

41:11Blackboard: Quick sort

41:11Blackboard: Quick sort

41:11Blackboard: Quick sort

48:48Blackboard: Picking your pivots

48:48Blackboard: Picking your pivots

48:48Blackboard: Picking your pivots

50:45Blackboard: Using randomness to potentially improve the running time of algorithms

50:45Blackboard: Using randomness to potentially improve the running time of algorithms

50:45Blackboard: Using randomness to potentially improve the running time of algorithms

52:21Blackboard: Radix sort

52:21Blackboard: Radix sort

52:21Blackboard: Radix sort

57:43Blackboard: (Pseudo) Insertion sort

57:43Blackboard: (Pseudo) Insertion sort

57:43Blackboard: (Pseudo) Insertion sort

1:00:34Q&A

🗩

1:00:34Q&A

🗩

1:00:34Q&A

🗩

1:01:46Blackboard: On using the most appropriate sorting algorithm for the dataset

1:01:46Blackboard: On using the most appropriate sorting algorithm for the dataset

1:01:46Blackboard: On using the most appropriate sorting algorithm for the dataset

1:12:30Blackboard: Sort stability

1:12:30Blackboard: Sort stability

1:12:30Blackboard: Sort stability

1:19:06Blackboard: "Shell sort"

1:19:06Blackboard: "Shell sort"

1:19:06Blackboard: "Shell sort"

1:29:14Wind down

🗩

1:29:14Wind down

🗩

1:29:14Wind down

🗩

⏬

Next: 'Can We Merge Sort In Place?'

⏬