Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void merge_tab(int tab[N],int l, int middle, int r)
- {
- int i,j,q;
- int tmp_tab[N];
- for(i=l; i <= r; i++)
- tmp_tab[i] = tab[i];
- i = l;
- j = middle + 1;
- q = l;
- while( i <= middle && j <= r){
- if(tmp_tab[i] < tmp_tab[j])
- tab[q++] = tmp_tab[i++];
- else
- tab[q++] = tmp_tab[j++];
- }
- while(i <= middle)
- tab[q++] = tmp_tab[i++];
- }
- void MergeSort(int tab[N], int l, int r)
- {
- if(l < r){
- int middle = (l+r)/2;
- MergeSort(tab,l,middle);
- MergeSort(tab,middle+1,r);
- merge_tab(tab,l,middle,r);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement