Two separate computers are used to sort 10,000,000 (10^7) integers. Computer A executes 10,000,000,000 (10^10) instructions per second, whereas Computer B only performs at 10,000,000 (10^7) instructions per second (i.e., A is 1000 times faster than B). Additionally, Computer A uses an insertion sort taking only 2-n^2 instructions, whereas Computer B uses an implementation of merge sort taking 50-n-log(n) instructions (n being the number of integers to sort)
Calculate the time it takes for each computer to sort (10^7) integers using the following equation:
Time (in seconds) = instructions / instructions per second
1 Progra
Which computer sorts the fastest?