Answered: Following is the partition function for…

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

See similar textbooks

Related questions

Question

Following is the partition function for quicksort, where we have used the leftmost number as a pivot. Assume that our array, ARR = {14, 8, 7, 38, 22, 15, 9}, which is 7 in size. What will be the array ARR after we apply "partition(A, 0, 6)"*

9, 15, 22, 38, 7, 8, 14

7, 8, 9, 14, 15, 22, 38

9, 8, 14, 7, 22, 15, 38

9, 8, 7, 14, 22, 15, 38

7, 9, 15, 22, 38, 14, 6

38, 22, 15, 14, 9, 8, 7

int partition(int A[], int left, int right){
int pivot = A[left];
int start = left;
int end = right;
while(start<end){
while(A[start]<=pivot){
start++;
}
while(A[end]>pivot){
end --;
}
if(start<end){
swap(A[start], A[end]);
}
}
swap (A[left], A[end]);
return end;
}

Expert Solution

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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.

Similar questions