Comments on: “If You’re Getting Bored, Let This Be A Lesson About O(n2) Sorts”

By: nanojath

nanojath — Tue, 25 Sep 2007 05:48:41 +0000

“…makes me feel like I’m in the future of the past.”

Isn’t that… the present?

By: Jeff

Jeff — Mon, 24 Sep 2007 23:54:37 +0000

The sound effects on the video are awesome–makes me feel like I’m in the future of the past.

By: thomas

thomas — Mon, 24 Sep 2007 21:03:26 +0000

Excellent point about the divide and conquer algorithms being well suited for parallel processing. Of course, this will still require us old-timers to take inter-processor communication into account when actually writing our code, unless we get those automatic parallelizing compilers we’ve been promised for the last decade or so.

By: Joey deVilla

Joey deVilla — Mon, 24 Sep 2007 17:57:05 +0000

Quicksort and Mergesort do lend themselves well to parallel processing since they both are “divide and conquer”-style algorithms.

As for quantum computing, I mentally file that stuff under “voodoo” and have no idea as to how classical algorithms will fare on such platforms.