« earlier | later » Page 1 of 2

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

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

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

How to Write a Spelling Corrector edit / delete

"The full details of an industrial-strength spell corrector are quite complex ... What I wanted to do here is to develop, in less than a page of code, a toy spelling corrector that achieves 80 or 90% accuracy at a processing speed of at least 10 words per second." Nice -- this'd be a good case study for our revamped algorithms module.

to algorithms computing cs programming spelling ... on 22 March 2015

Bertrand Meyer's technology+ blog » Blog Archive » Lampsort edit / delete

"Leslie Lamport likes to use the example of non-recursive Quicksort. Independently of the methodological arguments, his version of the algorithm should be better known." This is a nice bit of proper computer science: the basic idea is to describe Quicksort in terms of sets of objects that have yet to be sorted (i.e. sort of the same way you usually describe pathfinding algorithms like A*).

to algorithms cs sorting teaching ... on 18 January 2015

Redis new data structure: the HyperLogLog - Antirez weblog edit / delete

A neat algorithm for counting large sets of items using a small data structure, using hashing and some intelligent statistics.

to algorithms cardinality counting hyperloglog scalability ... on 29 May 2014

算盤 ABACUS: MYSTERY OF THE BEAD - Abacus instructions manual. Learn how to use abacus. edit / delete

It's that thing about data structures being more important than algorithms again. (Want to know how to compute the magnitude of a vector using an abacus? Instructions here.)

to abacus algorithms maths ... on 07 December 2012

The Goertzel Algorithm edit / delete

An easiest (than FFT) way of doing tone recognition.

to algorithms audio detect filter software tone ... on 03 December 2011

« earlier | later » Page 1 of 2

- algorithms | |

1 | + abacus |

1 | + astar |

3 | + audio |

1 | + cardinality |

5 | + cmp201 |

2 | + collision-detection |

1 | + complexity |

1 | + compression |

1 | + computing |

2 | + cosmos |

1 | + counting |

2 | + cs |

1 | + detect |

1 | + filter |

2 | + games |

1 | + graph |

2 | + graphics |

1 | + gta |

1 | + hyperloglog |

1 | + maths |

1 | + maze |

1 | + mixing |

1 | + pathfinding |

2 | + performance |

2 | + programming |

1 | + python |

2 | + research |

1 | + reverse-engineering |

1 | + scalability |

1 | + software |

2 | + sorting |

1 | + spelling |

1 | + teaching |

1 | + tone |

3 | + video |

tasty by Adam Sampson.