« earlier | later » Page 1 of 1

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

"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

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

Searching using A* (A-Star) edit / delete

to algorithms astar cmp201 pathfinding ... on 17 December 2016

Accidentally Quadratic edit / delete

"I started this blog because over my career so far as a software engineer, I’ve kept personally running into software that was slow, and wondering why. And when I had time to point a profiler at them and debug the slowness, I would very often discover quadratic behavior, which could usually be drastically improved to linear, with just a little work."

to algorithms cmp201 complexity performance programming ... on 27 November 2016

« earlier | later » Page 1 of 1

- cmp201 | |

3 | + algorithms |

1 | + astar |

1 | + c |

1 | + complexity |

1 | + correctness |

1 | + data-structures |

1 | + games |

1 | + graph |

1 | + language-design |

1 | + maze |

1 | + pathfinding |

1 | + performance |

1 | + programming |

1 | + safety |

1 | + teaching |

1 | + trie |

1 | + undefined-behaviour |

tasty by Adam Sampson.