sorted array Here is a C++ code that illustrates that sorting the data miraculously makes the code faster than the unsorted version. Let’s try out a sample C++ program to understand the problem statement better.
Implementation:
- CPP
// CPP program to demonstrate processing
// time of sorted and unsorted array
#include <iostream>
#include <algorithm>
#include <ctime>
usingnamespacestd;
constintN = 100001;
intmain()
{
intarr[N];
// Assign random values to array
for(inti=0; i<N; i++)
arr[i] = rand()%N;
// for loop for unsorted array
intcount = 0;
doublestart = clock();
for(inti=0; i<N; i++)
if(arr[i] < N/2)
count++;
doubleend = clock();
cout << "Time for unsorted array :: "
<< ((end - start)/CLOCKS_PER_SEC)
<< endl;
sort(arr, arr+N);
// for loop for sorted array
count = 0;
start = clock();
for(inti=0; i<N; i++)
if(arr[i] < N/2)
count++;
end = clock();
cout << "Time for sorted array :: "
<< ((end - start)/CLOCKS_PER_SEC)
<< endl;
return0;
}
Output
Time for unsorted array :: 0.000844 Time for sorted array :: 0.00023
Observe that time taken for processing a sorted array is less as compared to unsorted array. The reason for this optimisation for sorted array is branch prediction.
What is branch prediction ?
In computer architecture, branch prediction means determining whether a conditional branch(jump) in the instruction flow of a program is likely to be taken or not. All the pipelined processors do branch prediction in some form, because they must guess the address of the next instruction to fetch before the current instruction has been executed.
How branch prediction in applicable on above case ?
The if condition checks that arr[i] < 5000, but if you observe in case of sorted array, after passing the number 5000 the condition is always false, and before that it is always true, compiler optimises the code here and skips the if condition which is referred as branch prediction.
Case 1 : Sorted array
T = if condition true
F = if condition false
arr[] = {0,1,2,3,4,5,6, .... , 4999,5000,5001, ... , 100000}
{T,T,T,T,T,T,T, .... , T, F, F, ... , F }
We can observe that it is very easy to predict the branch in sorted array, as the sequence is TTTTTTTTTTTT………FFFFFFFFFFFFF
Case 2 : Unsorted array
T = if condition true
F = if condition false
arr[] = {5,0,5000,10000,17,13, ... , 3,21000,10}
{T,T,F, F, T, T, ... , T, F, T}
It is very difficult to predict that if statement will be false or true, hence branch prediction don’t play any significant role here.
Branch prediction works on the pattern the algorithm is following or basically the history, how it got executed in previous steps. If the guess is correct, then CPU continue executing and if it goes wrong, then CPU need to flush the pipeline and roll back to the branch and restart from beginning.
In case compiler is not able to utilise branch prediction as a tool for improving performance, programmer can implement his own hacks to improve performance.
More: What is the difference between “INNER JOIN” and “OUTER JOIN”?
