A problem about Sorting in Java
Part (A) Sort the array 15 80 35 25 60 30 into descending order using
a) the selection sort.
b) the buble sort.
Part (B) A first year student attempted to write mergesort in pseudocode as follows.
mergesort(theArray, n) {
if (n > 1){ // more than one item to sort
mergesort(left half of theArray, n/2)
mergesort(right half of theArray, n/2)
}
}
a) The above algorithm has a fundamental flaw. As written, how does it change theArray?
b) What is the worst-case runtime of this incorrect algorithm? Give as tight an asymptotic upper bound as possible, using Big-Oh notation as a function of n. Justify your answer.
The original course website where the problem comes from is here, I think it will be helpful if you take a look at it first: www.student.math.uwaterloo.ca/~cs134
- Plain text response
- Attached file(s):
- answer1.doc
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- Here are some recurrence relations that come up in the analysis of Quicksort and or Select. For each recurrence, write one sentence explaining how it relates to Quicksort or Select and give its asymptotic growth rate in Q notation. - see attached file
- This question deals with pseudo code for an action that is performed commonly. Also the objects used in this object oriented approach are to be identified. - Identify one task you perform regularly, such as cooking, mowing the lawn, or driving a car • Write a short, structured design (pseudocode only) that accomplishes this task. • Think ...
- Convert given flowchart into pseudocode. - Write the pseudo code for the attached flowchart that adds a series of user-entered numbers and terminates after displaying the sum when the user enters 0.
- Pseudocode to check if sum of 2 items in an array is 100 - Write and explain the pseudocode to check whether there are 2 items in an array of n integers so that their total is 100.
- Database - Create a query that lists all cities in descending order - I need help. I have to create a query that lists all cities in descending order. Each city should appear only once.
