Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- insertionSort(tab[], n)
- if(n == 0)
- return ;
- for(i = 1; i < n; i++)
- {
- temp = tab[i];
- j = i;
- while(j > 0 && temp < tab[j-1])
- {
- tab[j] = tab[j-1];
- j--;
- }
- tab[j] = temp;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement