INSTRUCTION: Answer Question 3 by refering to the funtion (2) below.#include <iostream>using namespace std;int sortSwapCount(int data[], int size, double &proportion){ int swapCount = 0; for (int i = 0; i < size - 1; i++) { for (int j = 0; j < size - i - 1; j++) { if (data[j] > data[j + 1]) { int temp = data[i]; data[i] = data[i+1]; data[i+1] = temp; swapCount++; } } } double expectedSwapCount = (double)size*(size-1); double swapCount1 = (double)swapCount; proportion = (swapCount1/expectedSwapCount)*100; return swapCount;} (3) The proportion which is calculated in the function of (2) above will be effectively updatedin the main function. Therefore, the function here will determine the status or conditionof the data distribution in the array. The function passes the proportion and returns thestatus. The function signature isstring listStatus (double proportion)The status must be stored in the variable status before returning it. If the proportion ofcount is above 80%, the array is unsorted, if the proportion is above 45% then the array ispartially sorted, if the proportion is above 0%, the array is almost sorted, otherwise, thearray is fully sorted. Return the status.

Answered: INSTRUCTION: Answer Question 3 by…

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

Concept explainers

Question

INSTRUCTION: Answer Question 3 by refering to the funtion (2) below.

#include <iostream>
using namespace std;

int sortSwapCount(int data[], int size, double &proportion)
{
int swapCount = 0;

for (int i = 0; i < size - 1; i++)
{
for (int j = 0; j < size - i - 1; j++)
{
if (data[j] > data[j + 1])
{
int temp = data[i];
data[i] = data[i+1];
data[i+1] = temp;
swapCount++;
}
}
}

double expectedSwapCount = (double)size*(size-1);
double swapCount1 = (double)swapCount;

proportion = (swapCount1/expectedSwapCount)*100;

return swapCount;
}

(3) The proportion which is calculated in the function of (2) above will be effectively updated
in the main function. Therefore, the function here will determine the status or condition
of the data distribution in the array. The function passes the proportion and returns the
status. The function signature is
string listStatus (double proportion)
The status must be stored in the variable status before returning it. If the proportion of
count is above 80%, the array is unsorted, if the proportion is above 45% then the array is
partially sorted, if the proportion is above 0%, the array is almost sorted, otherwise, the
array is fully sorted. Return the status.

Expert Solution

Step by step

Solved in 2 steps

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