Skip to content
Getting Sorted and Big O Notation - Computerphile episode artwork

Sep 5, 2026 14 min

Getting Sorted and Big O Notation - Computerphile

from Computerphile Hosted by Computerphile

How well sorted is your algorithm? Choosing the right method to sort numbers has a huge effect on how quickly a computer can process a task. Alex Pinkney talks about two popular sorting algorithms and how they 'scale up.'Follow up film "Quick Sort": http://youtu.be/XE4VP_8Y0BUAlex's code that generated the data for the tests: https://github.com/apinkney97/SortsAlex's graph of all the results: http://eprg.org/allplots.pdfhttp://www.facebook.com/computerphilehttps://twitter.com/computer_phileThis video was filmed and edited by Sean Riley.Computer Science at the University of Nottingham: http://bit.ly/nottscomputerComputerphile is a sister project to Brady Haran's Numberphile. See the full list of Brady's video projects at:http://periodicvideos.blogspot.co.uk/...

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

Getting Sorted and Big O Notation - Computerphile

0:00 14:43

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of Computerphile?

This episode is 14 minutes long.

When was this Computerphile episode published?

This episode was published on September 5, 2026.

Can I download this Computerphile episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.