News for hackers. Stuff that matters.
Re:Algorithms on Khan Academy – a collaboration with Dartmou... by rickdale on Monday November 17, 2014 @10:31PM (#8622241)
I learned about those four sorting algorithms before ap comp sci in high school. And I know I covered them again in college at some point. Also, I remember talking about big o in the second level cs class in college. So I see them as appropriate curriculum. I am not a genius programmer that wants to figure out two algorithms cause I understand the other two so well. Show them all to me, I'll take in what I can. That being said, I am intrigued that you have a different perspective and I will check out your book to see what you have to say.
Re:Algorithms on Khan Academy – a collaboration with Dartmou... by egonschiele on Monday November 17, 2014 @10:44PM (#8622266)
It is the typical curriculum. I'm curious about why it is appropriate. This should be about practical knowledge, not about "throw every algorithm at them and see what sticks"! That's why I only cover two sorting algorithms in my book. I cover selection sort to teach arrays, and I cover quicksort to teach recursion.
Re:Algorithms on Khan Academy – a collaboration with Dartmou... by bcbrown on Monday November 17, 2014 @11:05PM (#8622316)
Mergesort can be a good introduction to the divide-and-conquer pattern, which seems equally important in an algorithms course.
Re:Algorithms on Khan Academy – a collaboration with Dartmou... by dtwwtd on Tuesday November 18, 2014 @02:08AM (#8622774)
I think that a big part of algorithms knowledge is knowing what exists. So even a though typical curriculum forces the learning of each of these algorithms, I think the value is in knowing the trade offs between each in terms of complexity (space, time) and ordering.