1. Implement bubble sort, selection sort iteratively and recursively.

2. Implement linear search.

3. Familiarize with C++ STL class vector

Program Execution:

The following example illustrates how your program should work.

The program first reads the length of the vector (as 5 in example below), then reads this number of integers, and push them into a vector.

The program then reads a command (selection, bubble, rselection, rbubble), and call the corresponding sorting function to sort the vector.

The vector after being sorted will be displayed. Note that the user input are underscored.

[storm:]$ g++ lab1.cpp -o lab1.exe [

storm:]$ ./lab1.exe

5

 74 25 32 99 24 selection 24 25 32 74 99 

[storm:]$ ./lab1.exe 3 17 5 23 bubble

5 17 23

General Hints: * Write your main function first.

* Incrementally write one function and test it before moving to the next. Please refer to the slides on how to implement these functions.

1. selection: iterative selection sort function

2. bubble: iterative bubble sort function

3. rselection: recursive selection sort function

4. rbubble: recursive bubble sort function