Search for over 200,000 study notes and past assignments!



Download study resources by swapping your own or buying Exchange Credits.



Study from your library anywhere, anytime.

9 Pages Essays / Projects Year Uploaded: 2022

This report discusses about the Integration of Merge Sort and Insertion Sort. MergeSort is a divide-and-conquer algorithm. MergeSort first divides the problem into subproblems and continues to divide sub-problems into smaller sub-problems until no more sub-problems can be divided any further. Since our goal is to sort the items in a given list, after dividing the original problem into many small sub-problems, we have to conquer our sub-problems by sorting the items in each problem recursively. When the size of a sub-problem is relatively small, the overheads incurred by invoking many recursive methods render the MergeSort inefficient. Such inefficiency can be alleviated with the assistance of insertion sort, a sorting algorithm that runs efficiently for relatively small input. A small suitable threshold value (S) will be selected for limiting the size of a sub-problem. Whenever the subproblem size reaches the threshold (S), the algorithm will invoke insertion sort instead of proceeding to divide smaller sub-problems.

This document is 20 Exchange Credits

More about this document:

This document has been hand checked

Every document on Thinkswap has been carefully hand checked to make sure it's correctly described and categorised. No more browsing through piles of irrelevant study resources.

This is an Essay / Project

Essays / Projects are typically greater than 5 pages in length and are assessments that have been previously submitted by a student for academic grading.

What are Exchange Credits?

Exchange Credits represent the worth of each document on Thinkswap. In exchange for uploading documents you will receive Exchange Credits. These credits can then be used to download other documents for free.

Satisfaction Guarantee

We want you to be satisfied with your learning, that’s why all documents on Thinkswap are covered by our Satisfaction Guarantee. If a document is not of an acceptable quality or the document was incorrectly described or categorised, we will provide a full refund of Exchange Credits so that you can get another document. For more information please read Thinkswap's Satisfaction Guarantee.

Academic Integrity
Studying with Academic Integrity

Studying from past student work is an amazing way to learn and research, however you must always act with academic integrity.

This document is the prior work of another student. Thinkswap has partnered with Turnitin to ensure students cannot copy directly from our resources. Understand how to responsibly use this work by visiting ‘Using Thinkswap resources correctly’.

Claim a Bounty

CS2040 Group Project: Integration of Merge Sort and Insertion Sort - Page 1
Page 1 /9
Page 1 /9
CS2040 Group Project: Integration of Merge Sort and Insertion Sort - Page 2
Page 2 /9
Page 2 /9

Similar documents to "CS2040 Group Project: Integration of Merge Sort and Insertion Sort" avaliable on Thinkswap

Documents similar to "CS2040 Group Project: Integration of Merge Sort and Insertion Sort" are suggested based on similar topic fingerprints from a variety of other Thinkswap Subjects

Browse NUS Subjects


Junior College