Question b T [40 10 20 80 60 5 50 55] Given an array T, draw diagram that shows how partition function is implemented using partition (T,0,7).

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

quick sort 

Question b
T [40 10 20 80 60 5 50 55]
Given an array T, draw diagram that
shows how partition function is
implemented using partition (T,0,7).
Transcribed Image Text:Question b T [40 10 20 80 60 5 50 55] Given an array T, draw diagram that shows how partition function is implemented using partition (T,0,7).
|// Program 5.15
// Quick Sort function
int partition(int T[], int first,int last)
{ int pivot, temp;
int loop, cutPoint, bottom, top;
pivot=T[first];
bottom=first; top= last;
loop=1; //always TRUE
while (loop) {
while (T(top]>pivot)
while (T[top]>pivot)
{ top--;
}
{ top--;
}
while(T[bottom]<pivot)
while(T[bottom]<pivot)
{ bottom++;
if (bottom<top) {
temp=T[bottom];
T[bottom]=T[top];
T[top]=temp;
{ bottom++;
}
}
else {
loop=0;
Explain the purpose of the
following loops in the
function partition.
cutPoint = top;
}
}//end while
return cutPoint;
void quickSort(dataType arrayT[],int first,int last)
{
int cut;
if (first<last){
cut = partition(T, first,last);
quickSort(T, first,cut);
quickSort (T, cut+1, last);
}
Transcribed Image Text:|// Program 5.15 // Quick Sort function int partition(int T[], int first,int last) { int pivot, temp; int loop, cutPoint, bottom, top; pivot=T[first]; bottom=first; top= last; loop=1; //always TRUE while (loop) { while (T(top]>pivot) while (T[top]>pivot) { top--; } { top--; } while(T[bottom]<pivot) while(T[bottom]<pivot) { bottom++; if (bottom<top) { temp=T[bottom]; T[bottom]=T[top]; T[top]=temp; { bottom++; } } else { loop=0; Explain the purpose of the following loops in the function partition. cutPoint = top; } }//end while return cutPoint; void quickSort(dataType arrayT[],int first,int last) { int cut; if (first<last){ cut = partition(T, first,last); quickSort(T, first,cut); quickSort (T, cut+1, last); }
Expert Solution
steps

Step by step

Solved in 2 steps with 5 images

Blurred answer
Knowledge Booster
Fundamentals of Multithreaded Algorithms
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education