Suppose you needed to apply one (1) of the sort algorithms covered within Chapte

Question

Suppose you needed to apply one (1) of the sort algorithms covered within Chapter 16 in order to sort a collection of five (5) million objects. Each object within the collection represents automobile data. Assume that computer memory and time to complete the sorting were limited. Indicate the type of algorithm that you would apply. Provide a rationale for your response.'

Imagine you are a part of a team that is tasked with writing a mobile application (app) that will allow users to send pictures to their friends. The manager does not want to waste time creating code modules. Describe at least one (1) advantage of modularizing code for this type of task. Justify your response.

Explanation / Answer

Quick sort is a highly efficient sorting algorithm . This algorithm is based on partitioning of array of data into smaller arrays. A large array is partitioned into two arrays in which one holds values smaller than specified value say pivot based on which the partition is made and another array holds values greater than the pivot element.

The quick sort partitions an array and then calls itself recursively twice to sort the resulting two subarray.
This algorithm is quite efficient for large sized data sets as its average and worst case complexity are of O(nlogn) where n are number of elements.

Modularization makes the software development process easy to test and easy to maintain. The complexity of software development reduces when we modularize the program.

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.