Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Create a class SortingAlgorithms with the following methods. o mergeSort that will implement the algorithm learned in class (see slides for code and copy it from there) o selectionSort that will implement the algorithm learned in class (see slides for code and copy it from there ). o two fields: • mergeCtr that will count the merge sort steps • selectionCtr that will count the selection sort steps • these fields must be placed strategically to count every iteration of the sorting algorithms. o two more methods: · getMergeCtr that will return the value of mergeCtr • getSelectionCtr that will return the value of selectionCtr • An app SortingApp that will: o Create an array a with the values 22, 18, 12, -4, 58, sort it using mergeSort, and display the number of steps it took to sort it. o Create another array b with the same values as a 22, 18, 12, -4, 58 and sort it using selectionSort and display the number of steps it took to sort it. o Create another array c with the values 22, 18, 12, -4, 58, 7, 31, 42, -5, 8, 101, 45, 21,-9 sort it using mergeSort, and display the number of steps it took to sort it. o Create another array d with the same values as c 22, 18, 12, -4, 58, 7, 31, 42, -5, 8, 101, 45, 21,-9 and sort it using selectionSort and display the number of steps it took to sort it. • Compare the results among the different calls to the sorting methods, the steps it took to sort, and display a message with your conclusions.

Create a class SortingAlgorithms with the following methods. o mergeSort that will implement the algorithm learned in class (see slides for code and copy it from there) o selectionSort that will implement the algorithm learned in class (see slides for code and copy it from there ). o two fields: • mergeCtr that will count the merge sort steps • selectionCtr that will count the selection sort steps • these fields must be placed strategically to count every iteration of the sorting algorithms. o two more methods: · getMergeCtr that will return the value of mergeCtr • getSelectionCtr that will return the value of selectionCtr • An app SortingApp that will: o Create an array a with the values 22, 18, 12, -4, 58, sort it using mergeSort, and display the number of steps it took to sort it. o Create another array b with the same values as a 22, 18, 12, -4, 58 and sort it using selectionSort and display the number of steps it took to sort it. o Create another array c with the values 22, 18, 12, -4, 58, 7, 31, 42, -5, 8, 101, 45, 21,-9 sort it using mergeSort, and display the number of steps it took to sort it. o Create another array d with the same values as c 22, 18, 12, -4, 58, 7, 31, 42, -5, 8, 101, 45, 21,-9 and sort it using selectionSort and display the number of steps it took to sort it. • Compare the results among the different calls to the sorting methods, the steps it took to sort, and display a message with your conclusions.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

How can one do this in Java code?

• Create a class SortingAlgorithms with the following methods: o mergeSort that will implement the algorithm learned in class (see slides for code and copy it from there) o selectionSort that will implement the algorithm learned in class (see slides for code and copy it from there ). o two fields: • mergeCtr that will count the merge sort steps selectionCtr that will count the selection sort steps • these fields must be placed strategically to count every iteration of the sorting algorithms. o two more methods: · getMergeCtr that will return the value of mergeCtr . getselectionCtr that will return the value of selectionctr • An app SortingApp that will: o Create an array a with the values 22, 18, 12, -4, 58, sort it using mergeSort, and display the number of steps it took to sort it. o Create another array b with the same values as a 22, 18, 12, -4, 58 and sort it using selectionSort and display the number of steps it took to sort it. o Create another array c with the values 22, 18, 12, -4, 58, 7, 31, 42, -5, 8, 101, 45, 21,-9 sort it using mergeSort, and display the number of steps it took to sort it. o Create another array d with the same values as c 22, 18, 12, -4, 58, 7, 31, 42, -5, 8, 101, 45, 21,-9 and sort it using selectionSort and display the number of steps it took to sort it. • Compare the results among the different calls to the sorting methods, the steps it took to sort, and display a message with your conclusions.
Transcribed Image Text:• Create a class SortingAlgorithms with the following methods: o mergeSort that will implement the algorithm learned in class (see slides for code and copy it from there) o selectionSort that will implement the algorithm learned in class (see slides for code and copy it from there ). o two fields: • mergeCtr that will count the merge sort steps selectionCtr that will count the selection sort steps • these fields must be placed strategically to count every iteration of the sorting algorithms. o two more methods: · getMergeCtr that will return the value of mergeCtr . getselectionCtr that will return the value of selectionctr • An app SortingApp that will: o Create an array a with the values 22, 18, 12, -4, 58, sort it using mergeSort, and display the number of steps it took to sort it. o Create another array b with the same values as a 22, 18, 12, -4, 58 and sort it using selectionSort and display the number of steps it took to sort it. o Create another array c with the values 22, 18, 12, -4, 58, 7, 31, 42, -5, 8, 101, 45, 21,-9 sort it using mergeSort, and display the number of steps it took to sort it. o Create another array d with the same values as c 22, 18, 12, -4, 58, 7, 31, 42, -5, 8, 101, 45, 21,-9 and sort it using selectionSort and display the number of steps it took to sort it. • Compare the results among the different calls to the sorting methods, the steps it took to sort, and display a message with your conclusions.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS