Banks often record transactions on an account in order of the times of the transactions, but many people like to receive their bank statements with checks listed in order by check number. People usually write checks in order by check number, and merchants usually cash them with reasonable dispatch. The problem of converting time-of-transaction ordering to check-number ordering is therefore the problem of sorting almost-sorted input. Argue that the procedure INSERTION-SORT would tend to beat the procedure QUICKSORT on this problem.

Question

31-03-2020
Computers and Technology

contestada

Banks often record transactions on an account in order of the times of the transactions, but many people like to receive their bank statements with checks listed in order by check number. People usually write checks in order by check number, and merchants usually cash them with reasonable dispatch. The problem of converting time-of-transaction ordering to check-number ordering is therefore the problem of sorting almost-sorted input. Argue that the procedure INSERTION-SORT would tend to beat the procedure QUICKSORT on this problem.

Respuesta :

Otras preguntas

What is the 32nd term of the arithmetic sequence where a1 = 12 and a13 = -60

Two towns that are 35 km apart are 2.5 cm apart on a map. What is the scale of the map? 1 cm = 14 km 1 cm = 11.5 km 1 cm = 13 km 1 cm = 33.5 km

Fix the sentence by following the apostrophe rule. the stores policy states that it will not accept refunds, even if its their fault.

Choose the equation below that represents the line passing through the point (−2, −3) with a slope of −6. a. y = −6x − 15 b. y = −6x − 20 c. y = −6x + 15 d.

Rising levels of carbon dioxide most likely

An electron: (Select all that apply.) has a negative charge is found in the nucleus emits energy when it moves to a lower energy orbit from an excited state has

Noble gases have a full outer energy level and are inactive. these atoms are considered _____.

Which of the following should you ask yourself when analyzing word choice? a) Does the way in which the author uses language add or detract from the message?

Which prediction about a methane molecule would most likely be made by using both the quantum model of the atom and John Dalton's model? A.When the molecule rea

Which aquatic ecosystem typically forms along coastlines where fresh water and salt water meet, leading to varying degrees of salinity

ACCESS MORE EDU ACCESS Universidad de Mexico

ladijay ladijay · Answer 1 · 2020-04-01T03:28:23+02:00

Answer: Insertion Sort is more efficient , stable and faster than quick sort in writing sorting algorithms.

Insertion sort saves space without moving blocks of data and ensuring data stability.

Explanation:

Insertion Sort involves sorting given items in an algorithm by taking unsorted items, inserting them in sorted order in front of the other items and repeating until all items are in order.

Insertion sort process is relatively stable and faster compared to both quick sort and merge sort in algorithm manipulation since we are only moving smaller items in front without moving blocks of items.

On the other hand, Quick Sort is an algorithm that involves or chooses a random pivot and sort items smaller than the chosen pivot to the left and items bigger than the chosen pivot to the right till all items are in sorted order.

Quick Sort is a space sorting algorithm with extra stack frame space and has a risk of an unbalanced pivoting point which may cause extra running time and may also be highly unstable compared with Insertion sort method.