Implement sequential search and binary search algorithms on your computer. Run timings for each algorithm on arrays of size n = 10i for i ranging from 1 to as large a value as your computer’s memory/compiler will allow. For both algorithms store the values 0 through n – 1 in order in the array and use a variety of random search values in the range 0 to n – 1 on each size n. Graph the resulting times. When is sequential search faster than binary search for a sorted array?

support@paperspool.com

+ 1 (917) 341 1923