Some students exploits the bubble sort algorithm.. It's O.K with this homework!!
Lots of students have no idea about this homework.
That's why the due date of homework 8 is delayed
Why don't you try the following way:
The source code that we learned in the class traverses a sorted part of a given array backward.
Unfortunately, we cannot traverse a singly linked list backward.
Thus, you need to implement a new version of insertion sort algorithm that traverses the sorted part of the array forward!!
Then, you can simply convert an array version of the insertion sort algorithm into the new version of insertion sort algorithm under a singly linked list structure!!
I'll give you some tips for this homework on May 30.
However, I want you to do this homework with your own idea.
Please trust yourself !! (No pains No gains)
- Do not use a double linked list
- Just use a singly linked list
- You can use the insertion sort instead of the quick sort!! (The quick sort looks pretty hard to you guys!!)
- I'll explain how to sort a single linked list with the selection sort next week!!
This homework requires that you should submit your full source codes including a make file, header files, and all source files.
Besides, run each menu item (store, delete, search ...) and print its outcome to show that you build your program right.