3 basic intro level cpu science questions..

1. What numbers are compared to 72 if a sequential search is used; 2, 5, 7, 9, 11, 17, 18, 21, 28, 30, 45, 54,65, 69, 72. Also create the binary search tree.

 

2. write the data list that results from the shuffle-left algorithm to clean the following: 3, 0,0, 2, 6, 7, 0,0, 5, 1. Include steps.

 

3. Create a graph comparing the algorithms with efficiency, n, n^2, n^3, 2^n, & log n. Simple graph for comparison purpose only.