Data Structures.pptVIP

Selection Sort (2) Sort a collection of n integers. From those integers that are currently unsorted, find the smallest and place it next in the sorted list. The algorithm (pseudo code): for (int i = 0; i n ; i++) { /* Examine a[i] to a[n-1] and suppose the smallest integer is at a[j]; */ //Interchange a[i] and a[j]; } 1-* C Code for Selection Sort void sort (int *a, int n) { // sort the n integers a[0]~a[n?1] into nondecreasing order for ( int i = 0; i n; i++) { int j = i; // find the smallest in a[i] to a[n?1] for (int k = i+1; k n; k++) if (a[k] a[j]) j = k; // swap(a[i], a[j]); int temp = a[i]; a[i] = a[j]; a[j] = temp; } } 1-* Time Performance in C Code (1) #include time.h … time_t start, stop; … start = time(NULL); /* # of sec since 00:00 hours, Jan 1, 1970 UTC (current unix timestamp) */ … //the program to be evaluated stop = time(NULL); duration = ((double) difftime(stop, start); 1-* Time Performance in C Code (2) #include time.h … clock_t start, stop; … start = clock(); /* # of clock ticks since the program begins */ … //the program to be evaluated stop = clock(); duration = ((double) (stop - start) ) / CLOCKS_PER_SEC; 1-* * * * * * * * * * * * * * * * * Data Structures Chapter 1: Basic Concepts 1-* bit: basic unit of information. data type: interpretation of a bit pattern. e.g. 0100 0001 integer 65 ASCII code ’A’ BCD 41 (binary coded decimal) 1100 0001 unsigned integer 193 1’s complement ** 2’s complement ** Bit and Data Type 1-* 1’s and 2’s Complements range of 1’s complement in 8 bits -(27-1)~27-1 -127~127 range of 2’s complement in 8 bits = 127 = -128