Question (1) Create a C++ project for your assignment 3, with the name format prescribed in the Information section. Add a source file and name it SwapCount. In this file, write the C++ program that will perform the tasks specified in question 2. (2) Declare and implement a function called sortSwapCount that passes three parameters, the array, the size and the reference of proportion, and returns the count. The function declaration is (1) (1) int sortSwapCount(int data[], int size, doubles proportion) The function sorts the integers in data] in ascending order using the bubble sort method. The purpose is to count or determine the number of exchanges (swaps) made by the bubble sort algorithm. The expected number of sorting swaps (expectedSwapCount) is size" (size-1) if the array was unsorted. Calculate the proportion of the array status by first converting (or casting) the integers, swapCount and expectedSwapCount into floating-point, before calculating the proportion. The syntaxes for these calculations are double value = (double) x; double value = (double) x * 1.00; // if x is an integer or // try this if the first fails The proportion can be defined as the number of swaps counted over the expected swap counts, and multiply by 100 to present it in percentage.
Question (1) Create a C++ project for your assignment 3, with the name format prescribed in the Information section. Add a source file and name it SwapCount. In this file, write the C++ program that will perform the tasks specified in question 2. (2) Declare and implement a function called sortSwapCount that passes three parameters, the array, the size and the reference of proportion, and returns the count. The function declaration is (1) (1) int sortSwapCount(int data[], int size, doubles proportion) The function sorts the integers in data] in ascending order using the bubble sort method. The purpose is to count or determine the number of exchanges (swaps) made by the bubble sort algorithm. The expected number of sorting swaps (expectedSwapCount) is size" (size-1) if the array was unsorted. Calculate the proportion of the array status by first converting (or casting) the integers, swapCount and expectedSwapCount into floating-point, before calculating the proportion. The syntaxes for these calculations are double value = (double) x; double value = (double) x * 1.00; // if x is an integer or // try this if the first fails The proportion can be defined as the number of swaps counted over the expected swap counts, and multiply by 100 to present it in percentage.
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
Related questions
Question
![Question
(1) Create a C++ project for your assignment 3, with the name format prescribed in the
Information section. Add a source file and name it SwapCount. In this file, write the C++
program that will perform the tasks specified in question 2.
(2) Declare and implement a function called sortSwapCount that passes three parameters,
the array, the size and the reference of proportion, and returns the count. The function
declaration is
int sortSwapCount(int data[], int size, double& proportion)
The function sorts the integers in data[] in ascending order using the bubble sort
method. The purpose is to count or determine the number of exchanges (swaps)
made by the bubble sort algorithm.
(0)
(ii)
The expected number of sorting swaps (expectedSwapCount) is size*(size-1) if
the array was unsorted. Calculate the proportion of the array status by first
converting (or casting) the integers, swapCount and expectedSwapCount into
floating-point, before calculating the proportion. The syntaxes for these
calculations are
double value = (double) x;
double value = (double) x * 1.00;
// if x is an integer or
// try this if the first fails
The proportion can be defined as the number of swaps counted over the expected
swap counts, and multiply by 100 to present it in percentage.
Finally, return the swapCount.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1abc8645-5be5-439d-b2c3-77d10625b21c%2F6bc7bf6d-c23f-4d1f-b387-9abd762d73de%2F90j63s_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Question
(1) Create a C++ project for your assignment 3, with the name format prescribed in the
Information section. Add a source file and name it SwapCount. In this file, write the C++
program that will perform the tasks specified in question 2.
(2) Declare and implement a function called sortSwapCount that passes three parameters,
the array, the size and the reference of proportion, and returns the count. The function
declaration is
int sortSwapCount(int data[], int size, double& proportion)
The function sorts the integers in data[] in ascending order using the bubble sort
method. The purpose is to count or determine the number of exchanges (swaps)
made by the bubble sort algorithm.
(0)
(ii)
The expected number of sorting swaps (expectedSwapCount) is size*(size-1) if
the array was unsorted. Calculate the proportion of the array status by first
converting (or casting) the integers, swapCount and expectedSwapCount into
floating-point, before calculating the proportion. The syntaxes for these
calculations are
double value = (double) x;
double value = (double) x * 1.00;
// if x is an integer or
// try this if the first fails
The proportion can be defined as the number of swaps counted over the expected
swap counts, and multiply by 100 to present it in percentage.
Finally, return the swapCount.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education