Examples of Sorting Algorithms
?
?

## Global Keys

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)

q Quotes r References f Filter y Link c Credits

a
w
s
d
h j k l

## Quotes, References and Credits Menus

o Open URL (in new tab)

x, Space Toggle category and focus next
X, ShiftSpace Toggle category and focus previous
v Invert topics / media as per focus

z Toggle filter / linking mode

Enter Open URL (in new tab)
0:08Share a link from yesterday's chat1
0:08Share a link from yesterday's chat1
0:08Share a link from yesterday's chat1
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
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
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
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:28 So why would you not always do radix sort with a sort(sizeof(<type>), data_)?
🗪
1:01:28 So why would you not always do radix sort with a sort(sizeof(<type>), data_)?
🗪
1:01:28 So why would you not always do radix sort with a sort(sizeof(<type>), data_)?
🗪
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:12 Any news on potential Pat Wyatt guest stream to go more in-depth with the network stuff?
🗪
1:12:12 Any news on potential Pat Wyatt guest stream to go more in-depth with the network stuff?
🗪
1:12:12 Any news on potential Pat Wyatt guest stream to go more in-depth with the network stuff?
🗪
1:12:17 Did you mention sort stability at all?
🗪
1:12:17 Did you mention sort stability at all?
🗪
1:12:17 Did you mention sort stability at all?
🗪
1:12:30Blackboard: Sort stability
1:12:30Blackboard: Sort stability
1:12:30Blackboard: Sort stability
1:17:34 What else, if anything, do you think we'll need to sort besides the sprites?
🗪
1:17:34 What else, if anything, do you think we'll need to sort besides the sprites?
🗪
1:17:34 What else, if anything, do you think we'll need to sort besides the sprites?
🗪
1:17:51 Could we possibly generate / hint the ground chunks in such a way that using radix sort would be more optimal?
🗪
1:17:51 Could we possibly generate / hint the ground chunks in such a way that using radix sort would be more optimal?
🗪
1:17:51 Could we possibly generate / hint the ground chunks in such a way that using radix sort would be more optimal?
🗪
1:18:12 Yes, it is proven, I'm pretty sure
🗪
1:18:12 Yes, it is proven, I'm pretty sure
🗪
1:18:12 Yes, it is proven, I'm pretty sure
🗪
1:18:56 Is shell sort basically bubble sort with a variable span between values being compared (span decreases each run through)?
🗪
1:18:56 Is shell sort basically bubble sort with a variable span between values being compared (span decreases each run through)?
🗪
1:18:56 Is shell sort basically bubble sort with a variable span between values being compared (span decreases each run through)?
🗪
1:19:06Blackboard: "Shell sort"
1:19:06Blackboard: "Shell sort"
1:19:06Blackboard: "Shell sort"
1:20:58 Is this cross-platform yet?
🗪
1:20:58 Is this cross-platform yet?
🗪
1:20:58 Is this cross-platform yet?
🗪
1:21:46 Would something like a pivot table be a sort problem, or something else altogether? Is that more a sort / amalgamation / summarization?
🗪
1:21:46 Would something like a pivot table be a sort problem, or something else altogether? Is that more a sort / amalgamation / summarization?
🗪
1:21:46 Would something like a pivot table be a sort problem, or something else altogether? Is that more a sort / amalgamation / summarization?
🗪
1:22:04 Off-topic: Which more do you like, the fixed-function API of OpenGL or the programmable one? I've been using the modern approach but reading examples from the fixed pipeline they seem to be a lot more intuitive and easier to understand the flow of things
🗪
1:22:04 Off-topic: Which more do you like, the fixed-function API of OpenGL or the programmable one? I've been using the modern approach but reading examples from the fixed pipeline they seem to be a lot more intuitive and easier to understand the flow of things
🗪
1:22:04 Off-topic: Which more do you like, the fixed-function API of OpenGL or the programmable one? I've been using the modern approach but reading examples from the fixed pipeline they seem to be a lot more intuitive and easier to understand the flow of things
🗪
1:22:37 So by your description, is a stable sort resource intensive? Since it seems like it could be of max O(n^2*nlogn) depending on sort type? Since you have to run through the data twice?
🗪
1:22:37 So by your description, is a stable sort resource intensive? Since it seems like it could be of max O(n^2*nlogn) depending on sort type? Since you have to run through the data twice?
🗪
1:22:37 So by your description, is a stable sort resource intensive? Since it seems like it could be of max O(n^2*nlogn) depending on sort type? Since you have to run through the data twice?
🗪
1:24:11 When will you stop teasing us with the interactive fiction posts and get to the details?
🗪
1:24:11 When will you stop teasing us with the interactive fiction posts and get to the details?
🗪
1:24:11 When will you stop teasing us with the interactive fiction posts and get to the details?
🗪
1:24:20 Will you leave in some bugs for speedrunners to break the game with?
🗪
1:24:20 Will you leave in some bugs for speedrunners to break the game with?
🗪
1:24:20 Will you leave in some bugs for speedrunners to break the game with?
🗪
1:24:49 With a sort, is this actually adjusting and rewriting the data on the disk, or would it just be updating indexes or pointers? Just, once you sort, could you read start to finish, or is it pointer intensive: read 10 records, jump, read next 5, jump, read 2 more?
🗪
1:24:49 With a sort, is this actually adjusting and rewriting the data on the disk, or would it just be updating indexes or pointers? Just, once you sort, could you read start to finish, or is it pointer intensive: read 10 records, jump, read next 5, jump, read 2 more?
🗪
1:24:49 With a sort, is this actually adjusting and rewriting the data on the disk, or would it just be updating indexes or pointers? Just, once you sort, could you read start to finish, or is it pointer intensive: read 10 records, jump, read next 5, jump, read 2 more?
🗪
1:25:44 I mean, how you actually went about solving the problems, it seems so close for weeks, then... cliffhanger
🗪
1:25:44 I mean, how you actually went about solving the problems, it seems so close for weeks, then... cliffhanger
🗪
1:25:44 I mean, how you actually went about solving the problems, it seems so close for weeks, then... cliffhanger
🗪
1:27:01 I read a post the other day that said syntax coloring is bad for programming practices and enforces skimming rather then understanding. Do you agree or not?
🗪
1:27:01 I read a post the other day that said syntax coloring is bad for programming practices and enforces skimming rather then understanding. Do you agree or not?
🗪
1:27:01 I read a post the other day that said syntax coloring is bad for programming practices and enforces skimming rather then understanding. Do you agree or not?
🗪
1:27:59 Now I know that I have to buy a game to find out, that's fine. Thank you
🗪
1:27:59 Now I know that I have to buy a game to find out, that's fine. Thank you
🗪
1:27:59 Now I know that I have to buy a game to find out, that's fine. Thank you
🗪
1:29:14Wind down
🗩
1:29:14Wind down
🗩
1:29:14Wind down
🗩