1.  2003 Prentice Hall, Inc. All rights reserved. Using Arrays in Abstract Data Types

2.  2003 Prentice Hall, Inc. All rights reserved. What is an Abstract Data Type A built-in data type is an int, float, double, etc. An Abstract Data Type (ADT) is a collection of data and a set of operations on the data. You can use an ADT’s operations, if you know their specifications, without knowing how the operations are implemented or how the data is stored. Ultimately, you will implement an ADT with a data-structure, which is a construct you can define within a programming language to store a collection of data. Examples of ADT: lists, stacks, queues, trees, graphs, etc.

3.  2003 Prentice Hall, Inc. All rights reserved. ADT: SIMPLE LIST Examples of lists: lists of student id’s in a class, grocery items, lists of records in a collection, list of club members, etc…. Create a list Insert an element Arrange elements in sorted order Find if an element is in the list Delete an element Print the list of elements WHAT ARE BASIC OPERATIONS ON A LIST?

4.  2003 Prentice Hall, Inc. All rights reserved. What operations are likely to be performed on lists? Create/Insert an element Delete an element Arrange elements in sorted order (whatever sort criteria) Print the list of elements Find if an element is in the list Print statistics about list (if numeric) Grocery items: Chips Salsa Coke Tissues Sprite Jelly beans Original list Grocery items: Chips Salsa Coke Tissues Sprite Jelly beans Beer Add Beer Grocery items: Chips Salsa Coke Sprite Jelly beans Beer Delete tissues Grocery items: Beer Chips Coke Jelly beans Salsa Sprite Sort alphabetically Grocery items: Beer Coke Sprite Jelly beans Chips Salsa Sort by grocery aisles Is beer on the list?

5.  2003 Prentice Hall, Inc. All rights reserved. Implementation of the ADT List One way to implement a “list” is using an array to hold the elements in the list….. Now have to figure out how to : insert, delete, sort, find, etc…. In the next lessons, we will slowly build up these functionalities until we can integrate them all into a “list” program. EVENTUAL GOAL : CREATE A PROGRAM TO MAINTAIN A LIST OF STUDENTS……….

6.  2003 Prentice Hall, Inc. All rights reserved. Let’s make a simpler list Instead of strings, we will have a list of letters const int MAXCHARS = 8; char alpharray[MAXCHARS]; B J K M S Z 0 1 2 3 4 5 6 7

7.  2003 Prentice Hall, Inc. All rights reserved. Print Elements in a list for (i=0; i<numofelements; i++) cout << alpharray[i] << endl; Input elements into the list: // numtoinsert should be set to the number of initial elements to insert for (i=0; i<numtoinsert; i++) cin >> alpharray[i];

8.  2003 Prentice Hall, Inc. All rights reserved. Insert an element into an array Simple insert routine: find end of array, insert element: alpharray[endofarray] = newelement; endofarray++; B J K M S ZB J K M S Z L Before: After inserting L

9.  2003 Prentice Hall, Inc. All rights reserved. Insert a letter in the list Should it be inserted at the end of the list (in this case we need to know what is the end of the list)? Should the new element be inserted into the beginning of the list? Is the list stored in some special order and elements should be inserted to maintain that order – e.g., if the list is stored in alphabetical order the new element must be inserted in alphabetical order? Should the user choose where to store the new element?

10.  2003 Prentice Hall, Inc. All rights reserved. Assume the following letters are stored in array named alpharray: B, J, K, M, S, and Z. Write a program which calls a function adlet(), which accepts both the alphabet array and a new letter as parameters and inserts the new letter in the correct alphabetical order in the alphabet array. B J K M S Z alphabet [0] [1] [2] [3] [4] [5] [6] [7] …... B J K L M S Z After adding ‘L’ Before: INSERTING INTO A ARRAY BASED Alphabetical LIST

11.  2003 Prentice Hall, Inc. All rights reserved. ALGORITHM: Prompt user for new letter to add Find the position (index) of where this letter should go in the alphabetical array. (This is called a linear search.) Move all letters after this position down to free up the space Insert letter into array ****

12.  2003 Prentice Hall, Inc. All rights reserved. #include void insertletter(char[],char,int&); int main() { const int MAXCHARS = 30; const int STARTCHARS=6; char alpharray[MAXCHARS] = {‘B’, ‘J’, ‘K’, ‘M’,’S’,’Z’}; char newlet; int sizeofarray=STARTCHARS; while (5) { //loop forever cout << “ Enter a letter to add:”; cin >> newlet; insertletter(alpharray,newlet,sizeofarray); } CONTINUED…..

13.  2003 Prentice Hall, Inc. All rights reserved. Find position for new letter //find position for new letter while (alpharray[i] < addlet && i < sizeofarray) i++; newpos =i;

14.  2003 Prentice Hall, Inc. All rights reserved. Find position for new letter //move chars over --- should check for full array first if (sizeofarr == MAXCHARS) ….. for (i=sizeofarr; i>newpos; i--) alpharray[i] = alpharray[i-1];

15.  2003 Prentice Hall, Inc. All rights reserved. void insertletter(char alpharray[], char addlet, int& sizeofarr) { int i=0, endpos,newpos; //find position for new letter while (alpharray[i] < addlet && i < sizeofarr) i++; newpos =i; //move chars over --- should check for full array first for (i=sizeofarr; i>newpos; i--) alpharray[i] = alpharray[i-1]; alpharray[newpos] = addlet; //insert new letter sizeofarr++; //print out array for(i=0; i<sizeofarr; i++) cout <<alpharray[i]; }

16.  2003 Prentice Hall, Inc. All rights reserved. Analysis of the simple insertion algorithm In the worst case --- How many comparisons are needed to find the position of the letter to be inserted? In the worst case --- How many letters have to be shifted to make room for a new letter to be inserted? Are these the same cases?

17.  2003 Prentice Hall, Inc. All rights reserved. void insertletter(char alpharray[], char addlet, int& sizeofarr) { int i=0, endpos,newpos; //find position for new letter while (alpharray[i] < addlet && i < sizeofarr) i++; newpos =i; //move chars over --- should check for full array first for (i=sizeofarr; i>newpos; i--) alpharray[i] = alpharray[i-1]; alpharray[newpos] = addlet; //insert new letter sizeofarr++; //print out array for(i=0; i<sizeofarr; i++) cout <<alpharray[i]; What happens if the array is full? Can we use this code to insert elements into an empty list? If (sizeofarr == 0) { alpharray[0] = addlet; sizeofarr++; return 0; }

18.  2003 Prentice Hall, Inc. All rights reserved. Delete an element from a list Must find the element to delete: Then move everything over

19.  2003 Prentice Hall, Inc. All rights reserved. Delete Let’s assume we are given the position of the item to delete in delpos; DeleteElement(char alpharray[], int delpos, int& sizeofarr) { for (i=delpos+1; i<sizeofarr; i++) alpharray[i-1] = alpharray[i]; sizeofarr--; }

20.  2003 Prentice Hall, Inc. All rights reserved. ADT LIST: DONE: Insert element at end of a list; Insert element into previously sorted list TO DO: Sort List, Delete element, Create list, Find Element…..

21.  2003 Prentice Hall, Inc. All rights reserved. ADT: List Operation: sort. Given a list of unordered values in an array, sort the values so that they can be printed in sorted order.

22.  2003 Prentice Hall, Inc. All rights reserved. SIMPLE Sorting Sorting is a typical operation to put the elements in an array in order. Internal Sorts [for small data sets] selection bubble (exchange) External Sorts [for large data sets]

23.  2003 Prentice Hall, Inc. All rights reserved. Simple Sorting Selection sort Find smallest element, and put at the head of the list, repeat with remainder of list. The algorithm can also be formulated by finding the largest element and putting that at the head of the list

24.  2003 Prentice Hall, Inc. All rights reserved. Selection Sort index (k)sm_index 02 swap 21, 9 11 swap 13, 13 23 swap 21, 15 34 swap 21, 17 211591317 151791321 915211317 152191317 21159 17 Find smallest element, and put at the head of the list,repeat with remainder of list Scan 1 Scan 2 Scan 3 Scan 4

25.  2003 Prentice Hall, Inc. All rights reserved. Selection Sort const int size = 5; void sort(double [size]); void swap(double [size], int, int) // prototypes int main(void) {int index; double my_list[ ] = {21, 13, 9, 15, 17}; sort(my_list); // function call cout<<"\nThe sorted array is: \n"; for(index=0; index<size; index++) cout<<'\t'<<my_list[index]<<endl; … }

26.  2003 Prentice Hall, Inc. All rights reserved. Let’s build up the algorithm outer loop – array scans, each scan starts from the element after the previous scan inner loop – find smallest element swap smallest element with start of scan next outer loop

27.  2003 Prentice Hall, Inc. All rights reserved. Find Minimum void minimum(double testArray[], int k) { int j, sm_index; double smallest; // find the minimum from the k-th to the end in testArray[] } } smallest=testArray[k]; sm_index=k; …… for(j=k+1; j<size; j++) if(testArray[j]<smallest) {smallest=testArray[j]; sm_index=j; }

28.  2003 Prentice Hall, Inc. All rights reserved. Selection Sort void sort(double testArray[]) { int j, k, sm_index;double smallest; for(k=0; k<size-1; k++) // size-1 = number of passes { } } smallest=testArray[k]; sm_index=k; swap(testArray, sm_index, k);// call to swap() for(j=k+1; j<size; j++) if(testArray[j]<smallest) {smallest=testArray[j]; sm_index=j; }

29.  2003 Prentice Hall, Inc. All rights reserved. Selection Sort void swap(double testArray[], int smaller, int pass) {// pass = current position: k double temp; temp=testArray[pass]; testArray[pass]=testArray[smaller]; testArray[smaller]=temp; }

30.  2003 Prentice Hall, Inc. All rights reserved. for(k=0; k<size-1; k++) // size-1 = number of passes { } } smallest=testArray[k]; sm_index=k; swap(testArray, sm_index, k);// call to swap() for(j=k+1; j<size; j++) if(testArray[j]<smallest) {smallest=testArray[j]; sm_index=j; } How many times is the inner if statement called? How many times is the “sm_index” being reset? How many times is the swap() function called?

31.  2003 Prentice Hall, Inc. All rights reserved. 31 4.6Sorting Arrays Sorting data –Important computing application –Virtually every organization must sort some data Massive amounts must be sorted Bubble sort (sinking sort) –Several passes through the array –Successive pairs of elements are compared If increasing order (or identical), no change If decreasing order, elements exchanged –Repeat these steps for every element

32.  2003 Prentice Hall, Inc. All rights reserved. 32 Simple Sorting Bubble sort As we scan the list swap elements out of order. After the first scan, the largest element will be at the end of the list. Keep scanning the list until all of the elements are in the correct place. Bubble sort – because the small elements bubble up to the top…..

33.  2003 Prentice Hall, Inc. All rights reserved. 33 4.6Sorting Arrays Example: –Go left to right, and exchange elements as necessary One pass for each element –Original: 3 4 2 7 6 –Pass 1: 3 2 4 6 7 (elements exchanged) –Pass 2: 2 3 4 6 7 –Pass 3: 2 3 4 6 7 (no changes needed) –Pass 4: 2 3 4 6 7 –Pass 5: 2 3 4 6 7 –Small elements "bubble" to the top (like 2 in this example)

34.  2003 Prentice Hall, Inc. All rights reserved. Bubble Sort Put smaller first No change Put smaller first 212513917 2125 917 925211317 925132117

35.  2003 Prentice Hall, Inc. All rights reserved. Bubble Sort Begin again and put smaller first No change Put smaller first 211791325 172191325 211713925 211791325

36.  2003 Prentice Hall, Inc. All rights reserved. Bubble Sort Example 2 Begin --Put smaller first Put smaller first No change Put smaller first 1925181312 1925181312 13251918121325181912

37.  2003 Prentice Hall, Inc. All rights reserved. Bubble Sort – Example 2 Begin again and put smaller first No change Put smaller first 1912131825 1219131825 1912181325 1912131825

38.  2003 Prentice Hall, Inc. All rights reserved. Bubble Sort – Example 2 Begin again -- no change Swap – put smaller first Begin Again -- swap Sorted list 12191318251819121325 1219131825 1819131225

39.  2003 Prentice Hall, Inc. All rights reserved. 39 Let’s build up the algorithm – bubble sort outer loop – array scans, each scan starts from the first element of the list until _________ inner loop compare adjacent elements and swap next outer loop

40.  2003 Prentice Hall, Inc. All rights reserved. 40 4.6Sorting Arrays Swapping variables int x = 3, y = 4; y = x; x = y; What happened? –Both x and y are 3! –Need a temporary variable Solution int x = 3, y = 4, temp = 0; temp = x; // temp gets 3 x = y; // x gets 4 y = temp; // y gets 3

41.  2003 Prentice Hall, Inc. All rights reserved. Outline 41 fig04_16.cpp (1 of 3) 1 // Fig. 4.16: fig04_16.cpp 2 // This program sorts an array's values into ascending order. 3 #include 4 5 using std::cout; 6 using std::endl; 7 8 #include 9 10 using std::setw; 11 12 int main() 13 { 14 const int arraySize = 10; // size of array a 15 int a[ arraySize ] = { 2, 6, 4, 8, 10, 12, 89, 68, 45, 37 }; 16 int hold; // temporary location used to swap array elements 17 18 cout << "Data items in original order\n"; 19 20 // output original array 21 for ( int i = 0; i < arraySize; i++ ) 22 cout << setw( 4 ) << a[ i ]; 23

42.  2003 Prentice Hall, Inc. All rights reserved. Outline 42 fig04_16.cpp (2 of 3) 24 // bubble sort 25 // loop to control number of passes 26 for ( int pass = 0; pass < arraySize - 1; pass++ ) 27 28 // loop to control number of comparisons per pass 29 for ( int j = 0; j < arraySize – 1 - pass; j++ ) 30 31 // compare side-by-side elements and swap them if 32 // first element is greater than second element 33 if ( a[ j ] > a[ j + 1 ] ) { 34 hold = a[ j ]; 35 a[ j ] = a[ j + 1 ]; 36 a[ j + 1 ] = hold; 37 38 } // end if 39 Do a pass for each element in the array. If the element on the left (index j ) is larger than the element on the right (index j + 1 ), then we swap them. Remember the need of a temp variable.

43.  2003 Prentice Hall, Inc. All rights reserved. Outline 43 fig04_16.cpp (3 of 3) fig04_16.cpp output (1 of 1) 40 cout << "\nData items in ascending order\n"; 41 42 // output sorted array 43 for ( int k = 0; k < arraySize; k++ ) 44 cout << setw( 4 ) << a[ k ]; 45 46 cout << endl; 47 48 return 0; // indicates successful termination 49 50 } // end main Data items in original order 2 6 4 8 10 12 89 68 45 37 Data items in ascending order 2 4 6 8 10 12 37 45 68 89

44.  2003 Prentice Hall, Inc. All rights reserved. 44 Can we improve the algorithm? In the first example, we did not have to keep scanning the list since the list was sorted after the “2 nd ” scan…… Check to see if any swaps were performed on the previous inner loop. If none were performed do not scan the list anymore since it is sorted. ---- WE CAN END THE ALGORITHM EARLY: EARLY TERMINATION how can we accomplish this?

45.  2003 Prentice Hall, Inc. All rights reserved. Outline 45 24 // bubble sort 25 int flag = 1; 26 for ( int pass = 0; (pass < arraySize – 1) && flag; pass++ ) 27 flag = 0; 28 // loop to control number of comparisons per pass 29 for ( int j = 0; j < arraySize – 1 - pass; j++ ) 30 31 // compare side-by-side elements and swap them if 32 // first element is greater than second element 33 if ( a[ j ] > a[ j + 1 ] ) { 34 hold = a[ j ]; 35 a[ j ] = a[ j + 1 ]; 36 a[ j + 1 ] = hold; 37 flag = 1; //set flag since swap occurred 37 38 } // end if 39 Bubble sort with early termination Possible early termination

46.  2003 Prentice Hall, Inc. All rights reserved. Outline 46 24 // bubble sort 25 // loop to control number of passes 26 for ( int pass = 0; pass < arraySize - 1; pass++ ) 27 28 // loop to control number of comparisons per pass 29 for ( int j = 0; j < arraySize – 1 - pass; j++ ) 30 31 // compare side-by-side elements and swap them if 32 // first element is greater than second element 33 if ( a[ j ] > a[ j + 1 ] ) { 34 hold = a[ j ]; 35 a[ j ] = a[ j + 1 ]; 36 a[ j + 1 ] = hold; 37 38 } // end if 39 How many times does the outer loop execute in the worst case? How many times is the swap performed (inner loop) in the worst case?

47.  2003 Prentice Hall, Inc. All rights reserved. 47 ADT LIST So far we have seen the following operations on a “list”: Adding an element Deleting an element Sorting the list for display Computing statistics on a list of numeric values Last operation  Finding an element in a list

48.  2003 Prentice Hall, Inc. All rights reserved. 48 Finding an element is important: FOR DELETION: usually you must “find” the element before deleting it…. FOR INSERTION: must find the place to insert an element (if not in alphabetic order)…. TO PRINT: i.e., find students name & print grade

49.  2003 Prentice Hall, Inc. All rights reserved. 49 4.8Searching Arrays: Linear Search and Search array for a key value Linear search –Key value is the value to be searched for. It is usually inputted by the user. –Compare each element of array with key value Start at one end, go to other If the element is found, return the index number of the array. Remember --- we do not usually need to return the value, we know the value since it is what we were searching for. We need to know the POSITION of the value, i.e., its index.

50.  2003 Prentice Hall, Inc. All rights reserved. 50 SEARCHING Finding an element in an array Example: Given an array which contains a list of integers, find the index of a particular integer. 10 24 3 5 6 7 100 4 32 65 8 index of 24 is 1 index of 100 is 6 index of 35 is NOT FOUND 0 1 2 3 4 5 6 7 8 9 10

51.  2003 Prentice Hall, Inc. All rights reserved. Outline 51 fig04_19.cpp (1 of 2) 1 // Fig. 4.19: fig04_19.cpp 2 // Linear search of an array. 3 #include 4 5 using std::cout; 6 using std::cin; 7 using std::endl; 8 9 int linearSearch( const int [], int, int ); // prototype 10 11 int main() 12 { 13 const int arraySize = 100; // size of array a 14 int a[ arraySize ]; // create array a 15 int searchKey; // value to locate in a 16 17 for ( int i = 0; i < arraySize; i++ ) // create some data 18 a[ i ] = 2 * i; 19 20 cout << "Enter integer search key: "; 21 cin >> searchKey; 22 23 // attempt to locate searchKey in array a 24 int element = linearSearch( a, searchKey, arraySize ); 25 Takes array, search key, and array size.

52.  2003 Prentice Hall, Inc. All rights reserved. Outline 52 fig04_19.cpp (2 of 2) 26 // display results 27 if ( element != -1 ) 28 cout << "Found value in element " << element << endl; 29 else 30 cout << "Value not found" << endl; 31 32 return 0; // indicates successful termination 33 34 } // end main 35 36 // compare key to every element of array until location is 37 // found or until end of array is reached; return subscript of 38 // element if key or -1 if key not found 39 int linearSearch( const int array[], int key, int sizeOfArray ) 40 { 41 for ( int j = 0; j < sizeOfArray; j++ ) 42 43 if ( array[ j ] == key ) // if found, 44 return j; // return location of key 45 46 return -1; // key not found 47 48 } // end function linearSearch

53.  2003 Prentice Hall, Inc. All rights reserved. Outline 53 fig04_19.cpp output (1 of 1) Enter integer search key: 36 Found value in element 18 Enter integer search key: 37 Value not found

54.  2003 Prentice Hall, Inc. All rights reserved. 54 Linear Search Analysis In the worst case, how many elements have to be compared? int linearSearch( const int array[], int key, int sizeOfArray ) 40 { 41 for ( int j = 0; j < sizeOfArray; j++ ) 42 43 if ( array[ j ] == key ) // if found, 44 return j; // return location of key 45 46 return -1; // key not found 47 48 } // end function linearSearch

55.  2003 Prentice Hall, Inc. All rights reserved. 55 Analysis IF an element is not in the array, all of the elements in the array have to be checked to determine that a particular element is not there. FOR EXAMPLE: if there are 10 elements in the array, 10 comparisons have to be made in the worst case. Therefore, if there are n elements in the array... n comparisons have to be made in the worst case

56.  2003 Prentice Hall, Inc. All rights reserved. 56 What if the array were already sorted? Search for an element in a sorted array. 1 3 4 7 29 45 69 100 134 156 Do we have to check all of the elements if we know something about the order of the array? No -- we can search until we know the element cannot appear anymore, i.e. array[j] > target. However in the worst case the # of comparisons is still the number of elements in the array, I.e. we have to check all of the elements in the array

57.  2003 Prentice Hall, Inc. All rights reserved. 57 Better Linear Search for Sorted Array “Early termination” --- int linearSearchSorted( const int array[], int key, int sizeOfArray ) 40 { 41int j = 0; 42while ( j < sizeOfArray-1 && key < array[j]) 43 j++ ; 44 42 43 if ( array[ j ] == key ) // if found, 44 return j; // return location of key 45 46 return -1; // key not found 47 48 } // end function linearSearch

58.  2003 Prentice Hall, Inc. All rights reserved. 58 How to use a telephone book

59.  2003 Prentice Hall, Inc. All rights reserved. 59 To find the name “Randy Jackson” you would not start with Aardvark and continue until you hit the name...

60.  2003 Prentice Hall, Inc. All rights reserved. 60 start Input item; set lower index to zero set upper index to size-1 While lower index < upper indexReturn -1 Calculate midpoint Item == midpoint? Return index Item > midpoint Set upper index to midpoint-1 no yes Set lower index to midpoint + 1 no yes no Loop until found/not found

61.  2003 Prentice Hall, Inc. All rights reserved. 61 1 3 4 7 29 45 69 100 134 156 200 0 1 2 3 4 5 6 7 8 9 10 Midpoint low high Example 1: Looking for the number 140 Midpoint high low 0 1 2 3 4 5 6 7 8 9 10 low Midpoint high 0 1 2 3 4 5 6 7 8 9 highlow 0 1 2 3 4 5 6 7 8 9 10 How many comparisons?3

62.  2003 Prentice Hall, Inc. All rights reserved. 62 1 3 4 7 29 45 69 100 134 156 200 0 1 2 3 4 5 6 7 8 9 10 Midpoint low high Example 1: Looking for the number 7 Midpoint high low 0 1 2 3 4 5 6 7 8 9 10 low Midpoint high 0 1 2 3 4 5 6 7 8 9 10 How many comparisons? 3

63.  2003 Prentice Hall, Inc. All rights reserved. Outline 63 fig04_20.cpp (1 of 6) 1 // Fig. 4.20: fig04_20.cpp 2 // Binary search of an array. 3 #include 4 5 using std::cout; 6 using std::cin; 7 using std::endl; 8 9 #include 10 11 using std::setw; 12 13 // function prototypes 14 int binarySearch( const int [], int, int, int, int ); 15 void printHeader( int ); 16 void printRow( const int [], int, int, int, int ); 17 18 int main() 19 { 20 const int arraySize = 15; // size of array a 21 int a[ arraySize ]; // create array a 22 int key; // value to locate in a 23 24 for ( int i = 0; i < arraySize; i++ ) // create some data 25 a[ i ] = 2 * i; 26

64.  2003 Prentice Hall, Inc. All rights reserved. Outline 64 fig04_20.cpp (2 of 6) 27 cout << "Enter a number between 0 and 28: "; 28 cin >> key; 29 30 printHeader( arraySize ); 31 32 // search for key in array a 33 int result = 34 binarySearch( a, key, 0, arraySize - 1, arraySize ); 35 36 // display results 37 if ( result != -1 ) 38 cout << '\n' << key << " found in array element " 39 << result << endl; 40 else 41 cout << '\n' << key << " not found" << endl; 42 43 return 0; // indicates successful termination 44 45 } // end main 46

65.  2003 Prentice Hall, Inc. All rights reserved. Outline 65 fig04_20.cpp (3 of 6) 47 // function to perform binary search of an array 48 int binarySearch( const int b[], int searchKey, int low, 49 int high, int size ) 50 { 51 int middle; 52 53 // loop until low subscript is greater than high subscript 54 while ( low <= high ) { 55 56 // determine middle element of subarray being searched 57 middle = ( low + high ) / 2; 58 59 // display subarray used in this loop iteration 60 printRow( b, low, middle, high, size ); 61 Determine middle element

66.  2003 Prentice Hall, Inc. All rights reserved. Outline 66 62 // if searchKey matches middle element, return middle 63 if ( searchKey == b[ middle ] ) // match 64 return middle; 65 66 else 67 68 // if searchKey less than middle element, 69 // set new high element 70 if ( searchKey < b[ middle ] ) 71 high = middle - 1; // search low end of array 72 73 // if searchKey greater than middle element, 74 // set new low element 75 else 76 low = middle + 1; // search high end of array 77 } 78 79 return -1; // searchKey not found 80 81 } // end function binarySearch Use the rule of binary search: If key equals middle, match If less, search low end If greater, search high end Loop sets low, middle and high dynamically. If searching the high end, the new low is the element above the middle. while ( low <= high ) { 55 56 // determine middle element of subarray being searched 57 middle = ( low + high ) / 2; 58 59 // display subarray used in this loop iteration 60 printRow( b, low, middle, high, size );

67.  2003 Prentice Hall, Inc. All rights reserved. Outline 67 fig04_20.cpp (5 of 6) 82 83 // print header for output 84 void printHeader( int size ) 85 { 86 cout << "\nSubscripts:\n"; 87 88 // output column heads 89 for ( int j = 0; j < size; j++ ) 90 cout << setw( 3 ) << j << ' '; 91 92 cout << '\n'; // start new line of output 93 94 // output line of - characters 95 for ( int k = 1; k <= 4 * size; k++ ) 96 cout << '-'; 97 98 cout << endl; // start new line of output 99 100 } // end function printHeader 101

68.  2003 Prentice Hall, Inc. All rights reserved. Outline 68 fig04_20.cpp (6 of 6) 102 // print one row of output showing the current 103 // part of the array being processed 104 void printRow( const int b[], int low, int mid, 105 int high, int size ) 106 { 107 // loop through entire array 108 for ( int m = 0; m < size; m++ ) 109 110 // display spaces if outside current subarray range 111 if ( m high ) 112 cout << " "; 113 114 // display middle element marked with a * 115 else 116 117 if ( m == mid ) // mark middle value 118 cout << setw( 3 ) << b[ m ] << '*'; 119 120 // display other elements in subarray 121 else 122 cout << setw( 3 ) << b[ m ] << ' '; 123 124 cout << endl; // start new line of output 125 126 } // end function printRow

69.  2003 Prentice Hall, Inc. All rights reserved. Outline 69 fig04_20.cpp output (1 of 2) Enter a number between 0 and 28: 6 Subscripts: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ------------------------------------------------------------ 0 2 4 6 8 10 12 14* 16 18 20 22 24 26 28 0 2 4 6* 8 10 12 6 found in array element 3 Enter a number between 0 and 28: 25 Subscripts: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ------------------------------------------------------------ 0 2 4 6 8 10 12 14* 16 18 20 22 24 26 28 16 18 20 22* 24 26 28 24 26* 28 24* 25 not found

70.  2003 Prentice Hall, Inc. All rights reserved. Outline 70 fig04_20.cpp output (2 of 2) Enter a number between 0 and 28: 8 Subscripts: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ------------------------------------------------------------ 0 2 4 6 8 10 12 14* 16 18 20 22 24 26 28 0 2 4 6* 8 10 12 8 10* 12 8* 8 found in array element 4

71.  2003 Prentice Hall, Inc. All rights reserved. 71 SEARCH ALGORITHM BEST CASE WORST CASE Linear Search Entire array 1 Binary Search 1 The number of times you can divide the array by 2 = log 2 (#elems_in_array) ******* Sorted array:

72.  2003 Prentice Hall, Inc. All rights reserved. 72 What does log 2 mean? xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx Z elements xxxxxxxxxxxxxxxxxxxxxxxx Z/2 elements xxxxxxxxxxx Z/2/2 elements xxxxxx Z/2/2/2 elements Z 2 Z 2323 Z 2x2x =1? Log 2 z = x x is the number of times I can keep splitting the list until there is only 1 element left

73.  2003 Prentice Hall, Inc. All rights reserved. 73 Powers of 2 Below are tables for the power 2 x x2xx2x 12345678910111213 2481632641282565121024204840968192 141516171819202122 163843276865536131072262144524288104857620971524194304

74.  2003 Prentice Hall, Inc. All rights reserved. 74 SEARCH ALGORITHM BEST CASE WORST CASE Linear Search n 1 Binary Search 1 Log 2 (n) For an ORDERED array of n elements

75.  2003 Prentice Hall, Inc. All rights reserved. 75 SEARCH ALGORITHM BEST CASE WORST CASE Linear Searchn 1 Binary Search What about an unsorted array? NOT APPLICABLE