Those numbers seem very optimistic for sorting; did you mean nlogn(n) as opposed to n²?
Lanny Gilbert wrote:. . . compute in O(n) vs. O(log n). . . .
Lanny Gilbert wrote:Thanks for the reply, Daniel! Looks like this book is right up my alley. "Throwing fancy stuff around" seems to be the mantra of many computing books these days. Nice to see someone starting slow and building up, using
time-tested computer science techniques, to the best solution. NICE!
Campbell Ritchie wrote:You also don't want to move too fast for readers to keep up with you. I presume your exercises have that effect. Once you have got the exercise to work, you have taken the time to work through the theory.