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; }   B. 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; }   C. 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. intMedian(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; }

Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter8: Advanced Data Handling Concepts
Section: Chapter Questions
Problem 5RQ
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;

}

 

B. 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;

}

 

C. 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. intMedian(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;

}

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
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage