Using Visual Studio, Please help! Show solutions and code, please. Please do Que

Question

Using Visual Studio, Please help!
Show solutions and code, please.

Please do Question 8
-You need to write a new sorting function which calls the quicksort function and insertion sort function in the right places.

7. Modify quicksort) to use insertion sort if the sublist has fewer than LOWER BOUND elements for some constant LOWER_BOUND and use quicksort otherwise 8. The preferred alternative to the approach in Exercise 7 suggested in the text was to ignore all sublists with fewer than LOWER BOUND elements, not splitting them further. When execution of the quicksort algorithm terminates, simply sort the list using insertion sort. Modify quicksortO to incorporate this modification.

Explanation / Answer

#include "stdio.h"

int split ( int*, int, int ) ;

void main( )

{

int arr[10] = { 11, 2, 9, 13, 57, 25, 17, 1, 90, 3 } ;

int i ;

void quicksort ( int *, int, int ) ;

quicksort ( arr, 0, 9 ) ;

printf ( " Array after sorting: ") ;

for ( i = 0 ; i <= 9 ; i++ )

printf ( "%d ", arr[i] ) ;

}

void quicksort ( int a[ ], int lower, int upper )

{

int i ;

if ( upper > lower )

{

i = split ( a, lower, upper ) ;

if(i==lower || i== upper)

{

insertion(a,upper);

}

else

{

quicksort ( a, lower, i - 1 ) ;

quicksort ( a, i + 1, upper ) ;

}

}

}

int split ( int a[ ], int lower, int upper )

{

int i, p, q, t ;

p = lower + 1 ;

q = upper ;

i = a[lower] ;

while ( q >= p )

{

while ( a[p] < i )

p++ ;

while ( a[q] > i )

q-- ;

if ( q > p )

{

t = a[p] ;

a[p] = a[q] ;

a[q] = t ;

}

}

t = a[lower] ;

a[lower] = a[q] ;

a[q] = t ;

return q ;

}

void insertion(int arr[], int size)

{

int i,j,tmp;

for(i=0; i<size; i++)

{

for(j=i-1; j>=0; j--)

{

if(arr[j]>arr[j+1])

{

tmp=arr[j];

arr[j]=arr[j+1];

arr[j+1]=tmp;

}

else

break;

}

}

}

Related Questions

Navigate

• Browse (All)
• Browse U
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.