A free introduction to how computers search and sort data, in six short video lessons from CS50: linear search, binary search, bubble sort, selection sort, merge sort and recursion. Each lesson is a focused 3 to 14 minute walkthrough with worked examples, so you can watch them in order or jump to the one you need. Aimed at beginners; being able to read simple code helps but is not required.
Shared by Upgram Open Library under CC BY-NC-SA 4.0. Source: CS50 Shorts by CS50, Harvard University (https://cs50.harvard.edu/x/2024/shorts/). Re-encoded; captions, summaries and thumbnails generated by Upgram. Not endorsed by CS50 or Harvard University. Shared under the same licence.
0 ուսանող6 դասen
Ինչ կսովորեք
Explain how linear search and binary search find a value, and when each one works
Trace bubble sort, selection sort and merge sort step by step
Compare the sorting methods by how much work they do as the data grows
Use recursion to solve a problem by having a function call itself