Question: This JAVA project will allow you to compare & contrast different 4 sorting techniques, the last of which will be up to you to select.

This JAVA project will allow you to compare & contrast different 4 sorting techniques, the last of which will be up to you to select. You will implement the following:

1) Bubble Sort (pair-wise)

2) Bubble Sort (list-wise) [This is the selection sort]

3) Merge Sort

4) Your choice (candidates are the heap, quick, shell, cocktail, bucket, or radix sorts) [These will require independent research)

General rules:

Structures can be static or dynamic

You are not allowed to use built in methods that are direct or indirect requirements for this project You cannot use ANY built in sorting functions - I/O (System.in/out *) are ok. All compare/swap/move methods must be your own. (You can use string compares)

Your program will be sorting names you need at least 100 unique names (provided below) read them into the program in a random fashion (i.e. not in any kind of alpha order). *The more names you have, the easier it is to see trends in speed.

All sorts will be from low to high (by alpha)

EXTRA CREDIT: (

Add the ability to time each sort (there are time functions available you have to research). This ability would measure the time it takes for the program to execute each sort separately. 4%

Adjust the program to handle first and last names, and increase the number of names being processed to 500 3%

Using the same names, add a hash function (you must create yourself) and see if you can get your hash function to perform better than a log N (after your sorts are complete, a search module on your ordered structures can be assumed to give a log N search performance using a binary search). If you choose this extra credit, you must have additional runs and data printouts to show your hash structure as loaded. Also, analyze the results assuming that the search is the purpose of your program, compare search & sort vs. hash )

Names Provided:

Walt

Lawrence

Ken

Jennifer

David

Walter

Phil

Scotty

Todd

Leonard

Kara

Michelle

Jill

Steven

Wynn

Lloyd

Brandon

Gary

Jim

Dale

Joyce

Don

Tom

Christine

Rachel

Jeff

Raymond

Kelli

Charles

Kevin

Brant

Joseph

Michael

Kelly

Jessie

Suzie

Sally

Christian

Terry

John

Art

Francis

Riki

Evelyn

Tony

Ikaika

Joe

Ann

Neil

Daniel

Willie

James

Jeremy

Aislynn

Larry

Celeste

Paige

Dennis

Fred

Rosa

Ryan

George

Gabe

Lance

Carolyn

Mariah

Hal

Christina

Christopher

Mark

Stephen

Stanley

Sharon

Hannah

Gregory

Barry

Kawika

Greg

Derek

Philip

Alfredo

Jillian

Joedie

Anthony

Kyle

Bradley

Masa

Clyde

Robert

Zachary

Jaron

Fernando

Kosuke

Becky

Dora

Rheada

Ashley

Dustin

Joshuah

Ricardo

Pete

Katrina

Arwin

Mica

Arlene

Venus

Jenny

Nicole

Jeylyn

Trisha

Theresa

Eric

Terry

Trenton

Marcus

Tristan

Rueben

Melvin

Kurtis

Mary

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!