Recall merge sort sorts a vector of elements

Assignment Help Data Structure & Algorithms

Reference no: EM132121080

Recall Merge Sort sorts a vector of elements. Rewrite Merge Sort to sort a list of elements. You may use your own List or STL list. This must be in C++.

Write your own version of merge_sort(), merge(), and copy() functions.Do not use generic functions such as sort(), inplace_merge(), merge() or copy().

Do not use STL list methods such as sort() or copy(). Make sure the time complexity of your merge_sort() function is in O(n log n).

Make sure you take care of end conditions such as sorting a null list or a list of one element.

Give your own simple main() function that constructs a list, calls your merge sort, and prints the sorted sequence.

Reference no: EM132121080

Questions Cloud

Has anyone heard of distributed file systems : Has anyone heard of Distributed File Systems (DFS)? How can this approach help resolve the current issue presented in this Unit's DB?

Describe the implementation process and timeline : Describe the implementation process and timeline for your recommendations. Try to give as reasonable a timeline as possible and explain your plan.

Translates an organisations mission and strategy : Translates an organisation's mission and strategy into a set of performance measures that provide the framework for implementing its strategy"

Identify and explain tasks that you can automate : You were recently hired as a database administrator for CSU-Global Campus. During grade reporting, CSG-Global cannot afford to have any downtime.

Recall merge sort sorts a vector of elements : Write your own version of merge_sort(), merge(), and copy() functions.Do not use generic functions such as sort(), inplace_merge(), merge() or copy().

What annual rate of return must the fund portfolio earn : If you plan to invest for six years, what annual rate of return must the fund portfolio earn for you to be better off in the fund than in the CD?

Write a conjecture about how many leaves are present : Write a conjecture about how many leaves are present in a nonempty complete A-ary tree of height h.

Compare and contrast primary valuation alternatives : Compare and contrast primary valuation alternatives: historical costs (purchase price less accumulated depreciation), fair value (market price).

Define a relationship even x which is true : Based on the successor notion, define a relationship "odd (X)" which is true if X is an odd number.

User Account

All Pages