Which of the following function chooses a random index as the pivot? А. int Median(arr, left, right) { int mid; mid = (left + right)/2 if (arr[right] < arr[left); Swap(arr, left, right); //to swap arr[left],arr[right] if (arr[mid] < arr[left]); Swap(arr, mid, left);//to swap arr[left],arr[mid] if (arr[right] < arr[mid); Swap(arr, right, mid);// to swap arr[right],arr[mid] return mid; В. int Median(arr, left, right) int mid; mid = (left + right)/2 if (arr[right] > arr[left]); Swap(arr, left, right); //to swap arr[left],arr[right] if (arr[mid] < arr[left); Swap(arr, mid, left);//to swap arr[left],arr[mid] if (arr[right] < arr[mid]); Swap(arr, right, mid);// to swap arr[right],arr[mid] return mid; } С. int Median(arr, left, right) { int mid; mid = (left + right)/2 if (arr[left] < arr[right]); Swap(arr, left, right); //to swap arr[left),arr[right] if (arr[left] < arr[mid]); Swap(arr, mid, left);//to swap arr[left],arr[mid] if (arr[right] < arr[mid]); Swap(arr, right, mid);// to swap arr[right],arr[mid] return mid; } D. int Median(arr, left, right) { int mid; mid = (left + right)/2 if (arr[right] < arr[left]); Swap(arr, left, right); //to swap arr[left],arr[right] if (arr[left] < arr[mid]); Swap(arr, mid, left);//to swap arr[left],arr[mid] if (arr[mid] < arr[right|); Swap(arr, right, mid);// to swap arr[right],arr[mid] return mid; %3D

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
Which of the following function chooses a
random index as the pivot?
A.
int Median(arr, left, right)
{
int mid;
mid = (left + right)/2
if (arr[right] < arr[left);
Swap(arr, left, right); //to swap
arr[left],arr[right]
if (arr[mid] < arr[left]);
Swap(arr, mid, left);//to swap
arr[left],arr[mid]
if (arr[right] < arr[mid]);
Swap(arr, right, mid);// to swap
arr[right],arr[mid]
return mid;
}
В.
int Median(arr, left, right)
{
int mid;
mid = (left + right)/2
if (arr[right] > arr[left]);
Swap(arr, left, right); //to swap
arr[left],arr[right]
if (arr[mid] < arr[left);
Swap(arr, mid, left);//to swap
arr[left],arr[mid]
if (arr[right] < arr[mid]);
Swap(arr, right, mid);// to swap
arrſright],arr[mid]
return mid;
}
С.
int Median(arr, left, right)
{
int mid;
mid = (left + right)/2
if (arr[left] < arr[right]);
Swap(arr, left, right); //to swap
arr[left],arr[right]
if (arr[left] < arr[mid]);
Swap(arr, mid, left);//to swap
arr[left],arr[mid]
if (arr[right] < arr[mid]);
Swap(arr, right, mid);// to swap
arr[right),arr[mid]
return mid;
}
D.
int Median(arr, left, right)
{
int mid;
mid = (left + right)/2
if (arr[right] < arr[left);
Swap(arr, left, right); //to swap
arr[left],arr[right]
if (arr[left] < arr[mid]);
Swap(arr, mid, left);//to swap
arr[left],arr[mid]
if (arr[mid] <
Swap(arr, right, mid);// to swap
arr[right],arr[mid]
return mid;
arr[right]);
Transcribed Image Text:Which of the following function chooses a random index as the pivot? A. int Median(arr, left, right) { int mid; mid = (left + right)/2 if (arr[right] < arr[left); Swap(arr, left, right); //to swap arr[left],arr[right] if (arr[mid] < arr[left]); Swap(arr, mid, left);//to swap arr[left],arr[mid] if (arr[right] < arr[mid]); Swap(arr, right, mid);// to swap arr[right],arr[mid] return mid; } В. int Median(arr, left, right) { int mid; mid = (left + right)/2 if (arr[right] > arr[left]); Swap(arr, left, right); //to swap arr[left],arr[right] if (arr[mid] < arr[left); Swap(arr, mid, left);//to swap arr[left],arr[mid] if (arr[right] < arr[mid]); Swap(arr, right, mid);// to swap arrſright],arr[mid] return mid; } С. int Median(arr, left, right) { int mid; mid = (left + right)/2 if (arr[left] < arr[right]); Swap(arr, left, right); //to swap arr[left],arr[right] if (arr[left] < arr[mid]); Swap(arr, mid, left);//to swap arr[left],arr[mid] if (arr[right] < arr[mid]); Swap(arr, right, mid);// to swap arr[right),arr[mid] return mid; } D. int Median(arr, left, right) { int mid; mid = (left + right)/2 if (arr[right] < arr[left); Swap(arr, left, right); //to swap arr[left],arr[right] if (arr[left] < arr[mid]); Swap(arr, mid, left);//to swap arr[left],arr[mid] if (arr[mid] < Swap(arr, right, mid);// to swap arr[right],arr[mid] return mid; arr[right]);
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Types of trees
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
  • SEE MORE QUESTIONS
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