data.txt

33 34 12 29 6 49 24 19 87 8 95 25 35 77 9 45 83 43 75 70 94 30 73 76 78 7 10 22 88 91 41 71 96 55 80 97 16 3 31 64 18 46 61 21 5 23 89 11 98 82 53 79 86 39 54 72 15 52 4 56 57 99 63 40 67 28 69 90 92 2 68 47 60 36 38 44 93 37 42 20 48 51 59 62 32 58 74 1 66 13 17 84 81 50 14 26 65 27 85 

Modified from Programming Problem 4 on Page 94 mplement the algorithm kSmall, discussed in Section 2.4.4, as a C++ function. Use the first value of the array as the pivot. Use the main file that tests the class with data from a text file. Your code should work for any given file that has integers enumerated in a file (one value per line the code you developed. Deliverables 1. Source code for your class 2. Updated main file 3. Doxygen report for code documentation (as a pdf file) 4. Test output of your code (i.e., the kth smallest value with given data file) 5. A log file of traces i.e. log.txt) showing pivot value and state of the array after the partitioning of each round A! Modified from Programming Problem 4 on Page 94 mplement the algorithm kSmall, discussed in Section 2.4.4, as a C++ function. Use the first value of the array as the pivot. Use the main file that tests the class with data from a text file. Your code should work for any given file that has integers enumerated in a file (one value per line the code you developed. Deliverables 1. Source code for your class 2. Updated main file 3. Doxygen report for code documentation (as a pdf file) 4. Test output of your code (i.e., the kth smallest value with given data file) 5. A log file of traces i.e. log.txt) showing pivot value and state of the array after the partitioning of each round A