HostageX

Hey I was given this problem to do in my computer science class and the teacher doesnt help us much and tends to think we will find the answers online, but to much research i have yet to find an answer. I was wondering if anyone can help me with this?

Attached is the pdf of the work.

Thanks a lot in advance.

Attached Files

Lab5-MergeSort.pdf (54.3 KB, 46 views)

venar303

is this legal?

what do you need help understanding?
this is a neat resource for understanding how different sorts work. http://www.sorting-algorithms.com/

I hope nobody does your hw for you better to learn! merge sort is a great lesson in recursion, let me know what you need help with!

__________________
my new heroes: http://www.pugetsystems.com/submerged.php

decompiled

If you need help with a specific question ask away.

__________________

Windows 7║Fan Club

HostageX

This is the question i have. How fast is the best possible search (in terms of Big-O)? and how fast is the best possible sort?

version2

Are you perchance using Introduction to Algorithms? That book is horribly written. Apparently this book is more comprehensible.

Some links I had bookmarked:
http://www.mycplus.com/forum/post1172.htm
http://www.itl.nist.gov/div897/sqg/dads/terms.html

Also, Wikipedia has some good info on various sorting methods including pseudo code.

rabidgnome229

The lower bound for a comparison based sort is nlogn (many algorithms reach this asymptotic complexity - it is important to look at the constant factors). There are special cases that are linear such as bucket sort, but those aren't sorting as in sorting a list.