Java - This 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: Bubble Sort (pair-wise) Bubble Sort (list-wise) [This is the selection sort] Merge Sort 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 (you can use the 50 given in project #3) – 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) Names: 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
Java -
This 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:
- Bubble Sort (pair-wise)
- Bubble Sort (list-wise) [This is the selection sort]
- Merge Sort
- 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 (you can use the 50 given in project #3) – 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)
Names:
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
Trending now
This is a popular solution!
Step by step
Solved in 2 steps