In this project, we put a constraint on the number of comparisons that can be made for each of the sorting algorithms.

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

You are going to be exploring two sorting algorithms –

Shell sort and Bubble sort; and how the concept of approximate sorting works along with how we can measure, how good/bad an array of elements are sorted. Description: The two sorting algorithms that are given to you are Bubble and Shell sort.

Each of these algorithms are in the order of O(n2) in the worst case. And they take certain number of comparisons of elements to get to the result (completely sorted array). But what if we don’t have enough time to make all those comparisons?

In this project, we put a constraint on the number of comparisons that can be made for each of the sorting algorithms.

The two sorting algorithm methods are given in the boiler plate file. You may see that there is a check before every comparison to see if we go past the given number of comparisons or not. The first line in the input file is the number of elements(numElements). The line following that has the seed followed by the lower range and the upper range for random number generation. The seed is going to dictate the random numbers that are going to be generated.

And is dependent on the computer that is being used. So the output that you may have on your computer maybe different to the one that is being provided. But when you upload your program to GradeScope, it will use the seed given and generate the same numbers as generated by the solution program on GradeScope.

So, just stick to the output format and don’t worry about the numbers being generated differently. The last line of the input file will be the number of comparisons

(D) that the sorting algorithms must go through with the generated random numbers. Redirected input: Redirected input instructions from the previous project need to be followed to set everything up.

 

Attachments:

Expert's Answer

386 Times Downloaded

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of