Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
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);

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);

Database System Concepts
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
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

SEE SOLUTIONCheck out a sample Q&A here
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
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
SEE MORE TEXTBOOKS