Question

Demo Your instructor will now debug the below faulty QuickSort example int size 8,W makes code simpler void swapint "xp, int yp) yp-semp int partitionlint intArry int left, int right, int pivot) t int left Pointer left in righPointer right; printfi-Calling quick sort, index %d to %d with pivot %d、m"lea, righe, pivot while) N korp increasing left pointer until run into something greater thon pivet W keep decrcasing right pointer until nun into something smaller than piv 1 else t return leftPointer veid quickSortit intAmay{], int left, int right); fright-left 0) t int pivot intArray right): use the rightmost as pivot (lary int partnionlPoint- partition nt Amay, left, right,pie quickSort intAmay, partition Point+1ight oid display Array int intArrayD veid main) -14523,6,78 bl-14,72386,131 displayArrayta) display Arraytbk

Answer 1

//Modified merge program

#include<stdio.h>

int b[100];

void DoMerging(int a[] ,int startIndex , int midIndex , int endIndex){
       int first1= startIndex;
   int last1= midIndex;
   int first2 = midIndex+1;
   int last2 = endIndex;
   int index = first1;
  
   while(first1<=last1 && first2<=last2) {
       if(a[first1]<a[first2]) {
           b[index] = a[first1];
           first1++;
       }
       else {
           b[index] = a[first2];
           first2++;
          
       }
       index++;
      
   }
   while(first1<=last1) {
       b[index++] = a[first1++];
  
      
   }
   while(first2<=last2) {
       b[index++] = a[first2++];
  
   }
  
  
   int k;
   printf("Merge Result : ");
   for(k=startIndex;k<=endIndex ; k++){
       a[k] = b[k];
       printf("%d ",b[k]);
      
   }
   printf(" ");
}

void MergeSort(int a[] ,int startIndex ,int endIndex){
   int midIndex;
   if(startIndex<endIndex){
       midIndex = (startIndex+endIndex)/2;
       MergeSort(a,startIndex,midIndex);
       MergeSort(a,midIndex+1,endIndex);;
       DoMerging(a,startIndex,midIndex,endIndex);
   }
   else return;
}

int main(){
   int i;
   int a[]={17,22,10,22,49,30,25,2};
  
   printf("Original : ");
   for(i=0;i<8;i++)printf("%d ",a[i]);
   printf(" ");
   MergeSort(a,0,7);
  
   printf("Final Result : ");
   for(i=0;i<8;i++)printf("%d ",a[i]);
   printf(" ");
   return 0;
}

//sample output

C:\Users IshuManish\Documents\Merse.exe erge Result Merge Result 10 17 22 22 17 22 Merge Result 30 49 erge Result 2 25 rge Result 2 25 30 49 erge Result 2 10 17 22 22 25 30 49 inal Result 2 10 1 1722 22 23049 Process exited after .01234 seconds with return value Press any key to continue . -