# Data Structure

Instructions
Comparison of SORT algorithms

The objective of this Assignment is to compare the performance of some standard SORT algorithms.

You should look at MergeSort, QuickSort, (see attached code) and Selection Sort (from Week 2); you can also look at an additional Sort mechanism that isn’t covered in class or that isn’t covered in the book for extra credit. OR you can find an implmentation of Radix Sort.

You will have to find the right implementation in Java so that you can make your comparisons for the 4th algorithm (if you choose to go for the extra credit).

Things you will be comparing are the raw running time (measured with Java time functionality) and the time complexity (iteration count) in terms of a key operation for the algorithms (ex: as we discussed in class for Selection Sort comparisons are often a good way of measuring the time complexity of sort algorithms), for this purpose you’ll have to use meaningful count variables.
Refer to https://docs.oracle.com/javase/7/docs/api/java/lang/System.html for time methods.
Use:
https://docs.oracle.com/javase/7/docs/api/java/lang/System.html#currentTimeMillis()
or
https://docs.oracle.com/javase/7/docs/api/java/lang/System.html#nanoTime()
as you see fit.
Testing:

When comparing algorithms you want to make sure that you use a wide variety of test cases. In your case, you should have at least 4 different example sets on which to run your tests, each test case should have at least 20 numbers.

Report:

If you chose a 4th algorithm for extra credit, discuss which is the 4th algorithm and why you chose that.

You must have MergeSort, QuickSort, and Selection Sort.

Discuss your plan for testing. Explain the 4 test cases that you chose and explain briefly why you chose those test cases. Test cases must have at least 50 integers or more.

Summarize your results for both measured running time and time complexity.

Describe your conclusions including insights, and surprises if any. How does the measured time complexity compare with the expected O cost?

1. Test plan and code implementation: 50 points

2. Report and results: 40 points
3. What is the sorting mechanism that Arrays.sort() uses? How does that compare with the others? 10 points
4. Extra credit: up to 20 points

MAKE SURE TO USE TEAMS for discussion and to clear doubts.
You can either use the class attached or you can copy and paste into separate classes.

Sorter.java ( 5 KB; Mar 23, 2021 9:51 pm )

Pages (550 words)
Approximate price: -

Why Work with Us

Top Quality and Well-Researched Papers

We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.

We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

## Calculate the price of your order

Total price:
\$0.00

How it works?

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.

## Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.