Write an algorithm for shell sort and study its performance

Assignment Help Computer Engineering

Reference no: EM131842004

Problem

An algorithm called Shell Sort is inspired by Insertion Sort's ability to take advantage of the order of the elements in the list. In Shell Sort, the entire list is divided into noncontiguous subsists whose elements are a distance h apart for some number h. Each sub list is then sorted using Insertion Sort. During the next pass, the value of h is reduced, increasing the size of each sub list. Usually the value of each h is chosen to be relatively prime to its previous value. The final pass uses the value 1 for h to sort the list. Write an algorithm for Shell Sort, study its performance, and compare the result with the performance of Insertion Sort.

Reference no: EM131842004

Questions Cloud

Explain the conflict between the personal point : Explain the conflict between the personal point of view and the Kantian account of the moral point of view

Discuss top-down and bottom-up budgeting processes : Describe the differences between the top-down and bottom-up budgeting processes. Compare and contrast the two processes and explain when one process.

What would be the average time between orders : If the store currently uses a lot size of 1300 units, determine the annual holding cost and the annual ordering cost of this policy?

Describe role that networking can play in professional life : Develop a well-written paper that includes the following: Describe the role that networking can play in your professional life (accounting field)

Write an algorithm for shell sort and study its performance : Write an algorithm for Shell Sort, study its performance, and compare the result with the performance of Insertion Sort.

Calculating the present value of a single amount : ACCTG 375I - Lost Wages and Employment Litigation Homework. What is the mathematical formula for calculating the present value of a single amount

Implement an external-memory sorting algorithm : Implement an external-memory sorting algorithm and compare it experimentally to any of the internal-memory sorting algorithms described in this book.

Describe an external-memory algorithm : Describe an external-memory algorithm that determines (using O(n/B) transfers) whether a list of n integers contains a value occurring more than n/2 times.

Difference between production and operations : Briefly describe the terms operations management and supply chain. State briefly the difference between production and operations.

User Account

All Pages