Algorithms and Data Structures
Sheet1
| Name: | |||
| Possible: | Score: | Comments: | |
| Code | |||
| 16 | Insertion Sort (8 pts), Mergesort (8 pts) | ||
| 16 | Heapsort array structure and Heapify (8pts), efficient BuildHeap (8 pts) | ||
| 20 | Plots and correct output | ||
| 18 | No problems in compilation and execution? Non-compiling projects receive max total 10 points, and code that compiles but crashes during execution receives max total 18 points. | ||
| 70 | Total |