Decision Tree question: Among all comparison-based algorithms for sorting, determine the minimum number of comparisons in...
Decision Tree question: Among all comparison-based algorithms for sorting, determine the minimum number of comparisons in the worst case AND best case needed for the following number of elements:
2
3
4 (the answer to this is 5)
5
6
Some explanation would be great! I'm reviewing for my final. Thank you
Homework Answers
In the case of the Best case and Worst Case " Bubble sort and Insertion sort" are determine the minimum number of comparison. because this array is already sorted.so no more sort of number requires so it easily sorts this array.
Best time complexity:
- Bubble sort and Insertion sort : n because array isalready sorted.
- Selection Sort: n^2 this is independent of distributed data.
- Merge Sort and Heap Sort: nlogn this is also independent of distributed data.
- Quick Sort: nlogn
Worst-case time complexity:
- Bubble sort and Insertion sort: n^2
- Selection Sort: n^2 this is independent of distributed data.
- Merge Sort and Heap Sort: nlogn this is also independent of distributed data
- Quick sort : n^2
Add Answer to:
Decision Tree question: Among all comparison-based algorithms
for sorting, determine the minimum number of comparisons in...
Lower bound theory] Draw the decision tree for the comparison based sorting problem for four elements...
Lower bound theory] Draw the decision tree for the comparison based sorting problem for four elements a1, a2, a3, a4 by starting your comparison between a1:a2. (Tips: (1) There will be 4!=24 different leafs in your tree.
not A Question 5 In the worst case, the very best that a comparison based sorting...
not A
Question 5 In the worst case, the very best that a comparison based sorting algorithm can do when sorting n records is Q (n^2) Q(log (n!)) Q (logn) (n)
Problem 1. 1. Draw the decision tree for the merge-sort algorithm for the input consisting of...
Problem 1. 1. Draw the decision tree for the merge-sort algorithm for the input consisting of 3 numbers: a, b,c. 2. Draw the 4 top levels of the decision tree for the merge-sort algorithm for the input consisting of 4 numbers: a, b, c, d 3. How may leaves does this tree have? 4. How many levels does this tree have? 5. What is the number of comparisons needed to sort these 4 numbers by the merge-sort algorithm in the...
Implement and compare sorting algorithms. The task is to sort a list of integers using 5...
Implement and compare sorting algorithms. The task is to sort a list of integers using 5 sorting algorithms: selection sort insertion sort merge sort heap sort quicksort Your program should include 5 separate sorting methods, though it is fine for them to call some common methods (like "swap") if needed. Each sorting method should also count the number of comparison operations and assignment operations on the array elements during the sorting process. In the main program, two types of array...
consider lower bounds proofs on comparison based algorithms using decision trees. For each problem below, fill...
consider lower bounds proofs on comparison based algorithms using decision trees. For each problem below, fill in the table with: -a. The number of possible answers to the problem b. A lower bound based on the height of a decision tree for that problem. Simplify your answers. c. Explain why you think it is (or not) possible to create an algorithm with the same order as the bound that you found. Problem: 1- Search for the value X in an...
C++ Question 1 5 pts A binary heap's structure is an AVL tree a complete binary...
C++
Question 1 5 pts A binary heap's structure is an AVL tree a complete binary tree a particular case of binary search tree a sparse tree Question 2 5 pts When using a hash table with quadratic probing, and the table size is prime, then a new element can always be inserted if the table is at least half empty the table is full the table is at least half full the table is larger than any data value...
My tests for sorting algorithms are not working. sorting.py has 6 sorting algorithms and test_sorting.py has...
My tests for sorting algorithms are not working. sorting.py has 6 sorting algorithms and test_sorting.py has test cases to run those algorithms, but test cases are not working. please correct the errors in test_sorting.py file so that it can test all the sorting algorithms. WARNING: DON'T COPY AND PASTE THE QUESTION IN ANSWER. I WILL REPORT YOU. sorting.py # 1. selection sort # 2. insertion sort # 3. shell sort # 4. heap sort # 5. merge sort # 6....
//Generic interface that describes various searching and sorting //algorithms. Note that the type parameter is unbounded....
//Generic interface that describes various searching and sorting //algorithms. Note that the type parameter is unbounded. However, //for these algorithms to work correctly, the data objects must //be compared using the method compareTo and equals. //In other words, the classes implementing the list objects //must implement the interface Comparable. The type parameter T //is unbounded because we would like to use these algorithms to //work on an array of objects as well as on objects of the classes //UnorderedArrayList and...
Hello I need help with this program. Should programmed in C! Program 2: Sorting with Pointers...
Hello I need help with this program. Should programmed in C!
Program 2: Sorting with Pointers Sometimes we're given an array of data that we need to be able to view in sorted order while leaving the original order unchanged. In such cases we could sort the data set, but then we would lose the information contained in the original order. We need a better solution. One solution might be to create a duplicate of the data set, perhaps make...
DI Question 2 1.5 pts Which situations allow the client main() in the file my_program.py to access a method name, say f...
DI Question 2 1.5 pts Which situations allow the client main() in the file my_program.py to access a method name, say func(), alone, as in x-func) without dereferencing it using prepended name like modname.func or x = some object. func () or x-SomeClass.func() O func) is defined in some module, say, "modname.py" and modname is imported into my_program.py using: from modname import func() is an instance method or a class method in a class, say SomeClass, defined in the same...
not A
Question 5 In the worst case, the very best that a comparison based sorting algorithm can do when sorting n records is Q (n^2) Q(log (n!)) Q (logn) (n)
C++
Question 1 5 pts A binary heap's structure is an AVL tree a complete binary tree a particular case of binary search tree a sparse tree Question 2 5 pts When using a hash table with quadratic probing, and the table size is prime, then a new element can always be inserted if the table is at least half empty the table is full the table is at least half full the table is larger than any data value...
Hello I need help with this program. Should programmed in C!
Program 2: Sorting with Pointers Sometimes we're given an array of data that we need to be able to view in sorted order while leaving the original order unchanged. In such cases we could sort the data set, but then we would lose the information contained in the original order. We need a better solution. One solution might be to create a duplicate of the data set, perhaps make...
DI Question 2 1.5 pts Which situations allow the client main() in the file my_program.py to access a method name, say func(), alone, as in x-func) without dereferencing it using prepended name like modname.func or x = some object. func () or x-SomeClass.func() O func) is defined in some module, say, "modname.py" and modname is imported into my_program.py using: from modname import func() is an instance method or a class method in a class, say SomeClass, defined in the same...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago