Using heapsort to sort [10,5,10,5] and [5,10,5,10], on which of the two arrays, the relative order of all the elements of the same values will be preserved? Can you show a working behind your answer?   Options are:   1. only [10,5,10,5]   2. only [5,10,5,10]   3. none   4. both

Q: Apply Quick sort on a given sequence (10, 21, 12, 8, 3, 42, 1, 26, 14, 37, 7}. What is the sequence…

A: Answer : - option a) 8,3,1,7,10,21,12,42,26,14,37

Q: Read the problem below. If ever there will be codes in the answer, write the code in Python. Even…

A: Insertion sort does not use an extra array to give the final sorted elements whereas in the case of…

Q: how do i calculate the time taken to execute this algorithm? import random def insertionSort(arr):…

A: Required:       how do i calculate the time taken to execute this algorithm?

Q: Given the array [CA@53, dB$47, xH#12, zT%89, 1K&p3]. Let, A = 65, B = 66, C = 67 ... Y = 89, Z = 90;…

A: We have to provide the detailed solution in the below Picture:

Q: Suppose we have a hash map that uses the standard “mod” hash function shown in the chapter and uses…

A: Step by step solution for the given question on hashmap is given below.

Q: 3. Consider an example of hash table of size 30, and the following items are to be stored. Design…

A:

Q: Write a program to merge two arrays of 8 elements for each sorted in descending order. For i = 1 To…

A: According to the information given:- We have to choose the correct option to satisfy the code.

Q: Suppose you want to use Heapsort to sort the contents of the following array in alphabetical order:…

A: The heap that has been previously obtained is :

Q: In Merge sort, what is the effect of dividing the array into three parts then merge them, instead of…

A: In Merge sort, what is the effect of dividing the array into three parts then merge them, instead of…

Q: I have a priority queue with 11 entries stored as a heap in the following array: 3 4 5 7. 9 10 11…

A: As the elements in the priority queue are stored in the form of a min heap, so deleting the head…

Q: What do O(n), O(1) mean, respectively, given some operations, which operations are O(n) or O(1)?…

A:

Q: what is the correct formula for the load factor?

A: The load factor is the proportion of the array's size to the number of entries in the hash table.…

Q: In  Lamport's Hash we mentioned the notion of using only 64 bits of the hash. At each stage, 128…

A: The Lamport's Hash uses the hash function that produces a result of 128 bits. For the next step, the…

Q: Suppose you have started with a list of numbers and have built the following max-heap: 75 3 4 2 1.…

A: To Do: To find the first and second swaps.

Q: Consider the binary heap that uses the following array a[ ]=[ 9, 7, 4, 2, 6, 1, 3] to store its…

A: binary heap

Q: Consider the following list of keys: 80, 57, 65, 30, 45, 77, 27, 4, 90, 54, 45, 2, 63, 38, 81, 28,…

A: Here is the C++ program That will print the list after each sort: #include  <iostream>using…

Q: Quicksort is very efficient in practice and has an expected running time O (n log(n)). Why  would…

A: In this question we need to explain the application and uses of both quick sort and merge sort.…

Q: Question 99 In Quicksort, the most perfectly balanced split is achieved by the median element of the…

A: A quick sort algorithm should always aim to choose the middle most element as its pivot. Some…

Q: a. Given an array containing Strings, you need to write a code to store them in a hashtable. Assume…

A: Answer : Linear Probing: Linear probing implies that if the hash(x) %11 is already filled and we…

Q: Q.No.3 0 1 2 3 4 5 7 9. 10 11 A =| 1| 12 23 10 | 15 38| 45| 15 18 20 21 0 1 2 3 5 6. 7 8 9 10 11 B=|…

A:

Q: What are the lists obtained at first pass to sort 6, 3. 2, 4, 1.5 by using the bubble sort? A…

A: EXPLANATION: Bubble sort is that sorting algorithm which sorts the array elements by iteratively…

Q: i) Consider "key mod 7" as a hash function and a sequence of keys as 50, 700, 76, 85, 92, 73, and…

A: As per our guidelines we are supposed to answer only one question. Kindly repost other questions as…

Q: . Sort the maxheap below using techniques from heapsort.

A: Step 1:- Program Approach:- 1.Include header file  2.Initialize the array  3.Create the function…

Q: Consider the following heap, with array/list representation 20, 40, 186, 702, 292, 866, 751, 938,…

A: Please upvote. I am providing you the correct answer below. Please please please please.   1. 2.…

Q: What is the worst case time for a serial search in an array? What about binary search? What about…

A: Serial Search Scans an array of records taking one at a time. Finds the record that has the…

Q: Write a program to merge two arrays of 8 elements for each sorted in descending order. For i = 1 To…

A: We need to find the correct option regarding the given code.

Q: Given the array [aC@35, bD$74, hX#21, tZ%98, k1&3P]. [Let, A = 65, B = 66, C = 67, ... Y = 89, Z =…

A: Here, I have to provide a solution to the above question.

Q: Consider the situation when Quicksort is used to sort an array of n elements into ascending order,…

A: The best option to do the comparison of the algorithms would be to express or indicate the running…

Q: 3. Consider an example of hash table of size 30, and the following items are to be stored. Design…

A:

Q: Let us consider a hash table with an underlying array of length 5. It is initially empty, and we…

A: Given that, Let us consider a hash table with an underlying array of length 5. It is initially…

Q: Consider an array of elements {17, 20, 42, 9, 13, 3, 7, 24}, which two elements or set of elements…

A: Sorting is the process of sorting or arranging a list of elements from a collection. It's nothing…

Q: if we compare a hash table performanve with a binary search of a sorted array, the number od…

A: d . O(1) vs O(log n)

Q: ! Write a program to merge two arrays of 8 elements for each sorted in descending order. For i = 1…

A: The correct answer is - C  1- For i= 1 to 8 2- For j=1 to 8 3- a3(i)=a2(j) 4- i= i+1 5- For k = i+1…

Q: Given this array containing characters: Data M B A L J K C X Index 0 1 2 3 4 5 6 7 8 9 What does the…

A: Below is the answer to above question. I hope this will be helpful for you...

Q: In hashing, suppose that we start with a table of size one, do only insertions and lookups, and…

A: Step 1: In the given question, the default load factor is 0.5, which means the hash table size…

Q: Let M(n) be the minimum number of comparisons needed to sort an array A with exactly n elements in…

A: In merge sort the entire unsorted array is divided into two halves till atomic values are reached…

Q: A given implementation of bubble-sort takes on average 1 second to sort an array of 1000 elements.…

A: We need to approximate the time required for given scenarios.

Q: You may refer to the Floating Front Design algorithm (discussed in Queue and in code) for this…

A: Detail explanation is given below. Enqueue happens from back so back increases and dequeue happens…

Q: Please explain What is the worse-case performance of quicksort? Select the correct answer with the…

A: Options :  O(n*n), because during the partitioning stage it is possible that we select a 'bad'…

Q: In Java given the following array integers: 15 12 17 20 7 18 11 25 9 31 Draw the tree in that shows…

A:

Q: Suppose there are 4 sorted lists of elements each. If we merge these lists into a single sorted list…

A: The question wants to know about the number of key comparisons in the provided question of sorting…

Q: Show the steps of sorting the list 10, 28, 60, 5, 30, 17, 44 using heapsort algorithm.   Use the…

A:

Q: Write a program, which returns the index of the minimum repeating element of the array in Jinear…

A: Given:   Write a program, which returns the index of the minimum repeating element of the array in…

Q: Question Give the sequence of the 13 keys in the array that results after inserting the sequence of…

A:

Q: Given the following list, List = [ 9, 2, 5, 1, 3, 7, 6, 8 ] What is the order of the list after 5…

A: Insertion sort :-  In insertion sort we insert the element to its right position in sorted array by…

Q: Given a list containing the values: 8 7 59 3 4. a. Perform a trace of bubble sort as it would sort…

A: Given a list containing the values: 8 7 5 9 3 4.   a. Perform a trace of bubble sort as it would…

Q: (a) Merge Sort uses what sort of optimisation: greedy, backtracking or divide and conquer? MergeSort…

A: With our restriction on number of questions we can solve the first one only.    - The question is to…

Q: We create a Hash-table of integers where the hash function returns the first digit of the…

A: The answer is O(Log n).

Q: Consider implementing heaps by using arrays, which one of the following array represents a heap? O a…

A:

Merge sort

Merge Sort recursively sorts a given collection of numbers or elements by using the divide and conquer strategy in less time. It is one of the most used algorithms, with the worst-case time complexity of O (n log n). It was invented by John Von Neumann. The algorithm continuously divides an array into sub-arrays until each sub-array consists of a single element. It then merges those sub-arrays to produce a sorted array.