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