Tut_4 - Q5. Now implement the Bubble Sort algorithm. Q6....

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Programming & Data Structures Tutorial 4 Q1. Manually perform Bubble Sort on the following list of numbers. 21 30 57 5 3 23 54 12 42 26 7 Q2. Now perform Selection Sort on the numbers. Q3. Now manually perform Binary search on the numbers. (Remember the restriction). (i) Find the number 30 (ii) Find the number 5 Q4. Write a function that implements the Selection Sort algorithm that was done in class. Use your notes if necessary.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Q5. Now implement the Bubble Sort algorithm. Q6. And last but not least implement the Insertion Sort algorithm. Q7. Now put all 3 sorting algorithms into a package (i.e. sort.h) so that they may be reused again if necessary. Write a small client program to test each sort algorithm. Dont forget to import your sort package....
View Full Document

This note was uploaded on 05/25/2010 for the course CPE CPE 360 taught by Professor Jenniferchen during the Spring '10 term at Stevens.

Ask a homework question - tutors are online