BCS1223 Data Structure And Algorithms : LAB 2 Nov 2017

1. Rewrite and run the following C++ program.

 

2. Rewrite and run the following C++ program.

 

3. The sequential search algorithm as given in Question 1 does not assume that the list is in order. Therefore, it usually works the same for both sorted and unsorted lists. However, if the elements of the list are sorted, you can somewhat improve the performance of the sequential search algorithm. For example, if the search item is not in the list, you can stop the search as soon as you find an element in the list that is larger than the search item. Write the function seqOrdSearch to implement a version of the sequential search algorithm for sorted lists.