December 21st, 2015
Classroom Salon:
Videos
6.2 Quick Sort – selection
6.3 Quick Sort – duplicate keys
6.4 Quick Sort – system sorts
Check edmodo.com for assignments.
Monthly Archives: December 2016
“Hour of Code”
December 11th, 2014
“Hour of Code”
Create an account on codehs.com/go/F371 if you didn’t already.
Complete the Karel’s activity. Our school will show up on the map!
Project: Autocomplete me
December 9th, 2015
Programming Assignment: Autocomplete me
Due date: 12/21/2015
Thursday’s Hour of Code activity
December 8th, 2014
The Merge Sort
Visit ClassroomSalon.com for Sort Stability.
Visit edmodo.com for assignments.
Reminder:
Turn in your friend’s name for Thursday’s Hour of Code activity.
One activity you might want to show your friend:
The Hour of Code
The Merge Sort
December 1st, 2014
The Merge Sort
Visit ClassroomSalon.com
Homework:
0. Is mergesort faster than shellsort? Explain your rationale.
1. Does the abstract in-place merge produce proper output if and only if the two
input subarrays are in sorted order? Prove your answer, or provide a counterexample.
2. Give a trace, in the style of the trace given at the beginning of this section, showing how the keys A E Q S U Y E I N O S T are merged with the abstract in-place merge() method.
3. Geometric increments. Run experiments to determine a value of t that leads to the lowest running time of shellsort for random arrays for the increment sequence 1,[t],[t^2],[t^3],[t^4],[t^5], . . . for N = 10^6. Give the values of t and the increment sequences for the best three values that you find.