27 lines
818 B
Plaintext
27 lines
818 B
Plaintext
|
Q0: Which of the following sorting algorithms are (or can be made) stable?
|
|||
|
|
A: mergesort, quicksort with first element as pivot, selection sort with insertion,
|
|||
|
|
and insertion sort are stable.
|
|||
|
|
|
|||
|
|
Debrief:
|
|||
|
|
1. Approximately how many hours did you spend on this assignment?
|
|||
|
|
|
|||
|
|
Less than 1 hour.
|
|||
|
|
|
|||
|
|
2. Would you rate it as easy, moderate, or difficult?
|
|||
|
|
|
|||
|
|
Seemed easy, I didn't have any difficulties.
|
|||
|
|
|
|||
|
|
3. Did you work on it mostly alone, or mostly with other people?
|
|||
|
|
Note you are encouraged to discuss with your classmates,
|
|||
|
|
but each students should submit his/her own code.
|
|||
|
|
|
|||
|
|
Alone.
|
|||
|
|
|
|||
|
|
4. How deeply do you feel you understand the material it covers (0%–100%)?
|
|||
|
|
|
|||
|
|
Seems like 100%. Didn't have any difficulties.
|
|||
|
|
|
|||
|
|
5. Any other comments?
|
|||
|
|
|
|||
|
|
In my opinion, it kinda sucks that only 1 code assignment is auto-graded.
|