Tasty » Adam Sampson's cmp201 bookmarks

How I cut GTA Online loading times by 70% edit / delete

A nice example that combines reverse-engineering with some basic DS&A knowledge.

to algorithms cmp201 games gta performance reverse-engineering ... on 20 March 2021

Friday Facts #317 - New pathfinding algorithm | Factorio edit / delete

Making A* more efficient for a complex map.

to astar cmp201 games pathfinding ... on 19 October 2019

Teaching critical thinking | PNAS edit / delete

"In our study, students in the experiment condition were explicitly instructed to (and received grades to) quantitatively compare multiple collected datasets or a collected dataset and a model and to decide how to act on the comparisons." This would be an interesting way to teach performance measurement in CMP201...

to cmp201 critical-thinking science statistics teaching ... on 04 November 2018

abseil / C++ Tips of the Week edit / delete

Bite-sized advice on modern C++, from developers at Google. Feels much like the old C++ FAQ Lite entries. Worth a look for CMP201 students.

to c++ cmp201 generics language-design programming templates ... on 25 October 2018

Why is random testing effective for partition tolerance bugs? | the morning paper edit / delete

to cmp201 random testing ... on 24 October 2018

N4455 No Sane Compiler Would Optimize Atomics edit / delete

"Compilers do optimize atomics, memory accesses around atomics, and utilize architecture-specific knowledge. This paper illustrates a few such optimizations, and discusses their implications."

to atomic cmp201 compiler optimisation ... on 11 September 2018

p1v0t/Sort: Implementation of some of comparison based sorting algorithms edit / delete

... in the style of qsort.

to algorithms cmp201 sorting ... on 06 January 2018

Algorithms for making more interesting mazes edit / delete

Nicely related to graph algorithms. CMP201 students will probably find this interesting!

to algorithms cmp201 games graph maze ... on 06 April 2017

qp tries edit / delete

"A qp trie is like a crit-bit trie (aka patricia trie) except each branch is indexed by a few bits at a time instead of one bit. The array of sub-tries at a branch node is compressed using the popcount trick to omit unused branches." I'm thinking about teaching crit-bit tries in CMP201 next year...

to cmp201 data-structures trie ... on 06 April 2017

A Guide to Undefined Behavior in C and C++, Part 1 – Embedded in Academia edit / delete

A good overview for students.

to c cmp201 correctness language-design safety teaching undefined-behaviour ... on 10 February 2017