JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.
CS101 F15 Sorting algorithms
Sign in to Google
to save your progress.
Learn more
* Indicates required question
Please enter your first and last name:
*
Your answer
Selection sort (Harvard CS50)
Video link:
https://www.youtube.com/watch?v=f8hXR_Hvybo
The selection sort keeps track of two portions of the list. What do they represent?
*
Minimum and maximum
Sorted and unsorted
Above average and below average
Even and odd
Each time through the list, the selection sort kept track of:
*
Current minimum
Average value
Current maximum
Length of the list
Getting sorted (Computerphile)
Video link:
http://www.youtube.com/watch?v=kgBjXUE_Nwc
Which algorithm has the best performance for large lists?
*
Bubble sort
Better bubble sort
Merge sort
Gnome sort
What did we observe about bubble sort that allows the "better bubble sort" to (slightly) improve the running time?
*
Your answer
Submit
Clear form
Never submit passwords through Google Forms.
This content is neither created nor endorsed by Google.
Report Abuse
-
Terms of Service
-
Privacy Policy
Forms
