Sorting: void bubble_sort(int arr[], int n, unsigned& comparisons, unsigned& swaps); void merge_sort(int arr[], int start, int end, unsigned& comparisons, unsigned& moves);

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter12: Points, Classes, Virtual Functions And Abstract Classes
Section: Chapter Questions
Problem 3PE
icon
Related questions
Question

This sorting function and the merge one is very similar can someone help please? its in C++

Sorting:
void bubble_sort(int arr[], int n, unsigned& comparisons, unsigned& swaps);
void merge_sort(int arr[], int start, int end, unsigned& comparisons, unsigned& moves);
The bubble_sort function is to sort the array parameter using the bubble sort approach, which
uses a nested loop. In addition, the function shall store the number of comparisons and swaps
performed by the algorithm in respective parameters.
The merge_sort function is to sort the array parameter using the merge sort approach, which
is a recursive approach. In addition, the function shall store the number of times two elements
are compared to each other as well as the number of times an array element is moved from one
slot to another.
Transcribed Image Text:Sorting: void bubble_sort(int arr[], int n, unsigned& comparisons, unsigned& swaps); void merge_sort(int arr[], int start, int end, unsigned& comparisons, unsigned& moves); The bubble_sort function is to sort the array parameter using the bubble sort approach, which uses a nested loop. In addition, the function shall store the number of comparisons and swaps performed by the algorithm in respective parameters. The merge_sort function is to sort the array parameter using the merge sort approach, which is a recursive approach. In addition, the function shall store the number of times two elements are compared to each other as well as the number of times an array element is moved from one slot to another.
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

This is very helpful thank you, the code I came up with is this but I am not sure how to finish it

void bubble_sort(int arr[], int n, unsigned& comparison, unsigned& swaps) {

if (arr[n]==1) {

comparison++

}

else if (n > n+1) {
swap(n, n-1)

}

 

 

and 

void merge_sort(int arr[], int start, int end, unsigned& comparison, unsigned& moves) {

if (arr[n] % 2 ==0) {

arr[n] / 2 

}

Solution
Bartleby Expert
SEE SOLUTION
Knowledge Booster
Binary Search Algorithm
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
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning