Intro to Algorithms: Crash Course Computer Science #13
1572793 People Read – 30119 People Liked – You Can Also Like
Algorithms are the sets of steps necessary to complete computation – they are at the heart of what our devices actually do. And this isn’t a new concept. Since the development of math itself algorithms have been needed to help us complete tasks more efficiently, but today we’re going to take a look a couple modern computing problems like sorting and graph search, and show how we’ve made them more efficient so you can more easily find cheap airfare or map directions to Winterfell… or like a restaurant or something.
Ps. Have you had the chance to play the Grace Hopper game we made in episode 12. Check it out here! http://thoughtcafe.ca/hopper/
In the pseudocode for selection sort at 3:09, this line:
swap array items at index and smallest
swap array items at i and smallest
Produced in collaboration with PBS Digital Studios: http://youtube.com/pbsdigitalstudios
Want to know more about Carrie Anne?
The Latest from PBS Digital Studios: https://www.youtube.com/playlist?list…
Want to find Crash Course elsewhere on the internet?
Facebook – https://www.facebook.com/YouTubeCrash…
Twitter – http://www.twitter.com/TheCrashCourse
Tumblr – http://thecrashcourse.tumblr.com
Support Crash Course on Patreon: http://patreon.com/crashcourse
CC Kids: http://www.youtube.com/crashcoursekids