Programming Lab: Create a package named lab10 (no spaces, ALL in lowercase) where you will place your lab files. Create a class SortingAlgorithms with the following methods: mergeSort that will implement the algorithm learned in class (see slides for code and copy/paste it from there) selectionSort that will implement the algorithm learned in class (see slides for code and copy/paste it from there ). 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. two more methods: getMergeCtr that will return the value of mergeCtr getSelectionCtr that will return the value of selectionCtr An app SortingApp that will: 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. 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. 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. 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 observations and your conclusions.

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

Question

Programming Lab:

Create a package named lab10 (no spaces, ALL in lowercase) where you will place your lab files.
Create a class SortingAlgorithms with the following methods:
- mergeSort that will implement the algorithm learned in class (see slides for code and copy/paste it from there)
- selectionSort that will implement the algorithm learned in class (see slides for code and copy/paste it from there ).
- 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.
- two more methods:
  - getMergeCtr that will return the value of mergeCtr
  - getSelectionCtr that will return the value of selectionCtr
An app SortingApp that will:
- 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.
- 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.
- 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.
- 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 observations and your conclusions.

Expert Solution

Trending now

This is a popular 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