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

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

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

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Linked List Representation
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-engineering and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY