Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
11th Edition
ISBN: 9780134670942
Author: Y. Daniel Liang
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 7.11, Problem 7.11.1CP
Program Plan Intro
Array:
An array is defined as a group that consists of similar data types.
- The array size must be specified by an “int” value and not long or short.
- In Java, all arrays are allocated dynamically.
- An array is always indexed, starting from 0.
Selection sort
- Sorting is a process to place the elements in order.
- Selection sort is used to sort the group of data.
- Selection sort finds the smallest element in the array by comparing all the elements.
- The element values in the array are exchanged to place the smallest element in the first position.
- Continuously, it finds the next smallest element and exchanges it in the successive positions.
- The exchange process may place one or more elements in its permanent place.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Write an ALP to execute the following:
a) Largest number in a given array
b) Smallest number in a given array
C) Sort in ascending order
d) Sort in descending order
Using the C language, Write a program that to perform an insertion sort for the following array. Please provide the time complexity of the insertion sort.
4
12
7
8
2
5
15
Use the same array to write a program using merge sort and provide a time complexity of merge sort
Apply Selection Sort on the following list of elements: 16, 23, 19, 6, 20, 10, 34, 54
Chapter 7 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Ch. 7.2 - Prob. 7.2.1CPCh. 7.2 - Prob. 7.2.2CPCh. 7.2 - What is the output of the following code? int x =...Ch. 7.2 - Indicate true or false for the following...Ch. 7.2 - Which of the following statements are valid? a....Ch. 7.2 - Prob. 7.2.6CPCh. 7.2 - What is the array index type? What is the lowest...Ch. 7.2 - Write statements to do the following: a. Create an...Ch. 7.2 - What happens when your program attempts to access...Ch. 7.2 - Identify and fix the errors in the following code:...
Ch. 7.2 - What is the output of the following code? 1....Ch. 7.4 - Will the program pick four random cards if you...Ch. 7.5 - Use the arraycopy method to copy the following...Ch. 7.5 - Prob. 7.5.2CPCh. 7.7 - Suppose the following code is written to reverse...Ch. 7.8 - Prob. 7.8.1CPCh. 7.8 - Prob. 7.8.2CPCh. 7.9 - Prob. 7.9.1CPCh. 7.9 - Prob. 7.9.2CPCh. 7.10 - If high is a very large integer such as the...Ch. 7.10 - Prob. 7.10.2CPCh. 7.10 - Prob. 7.10.3CPCh. 7.11 - Prob. 7.11.1CPCh. 7.11 - How do you modify the selectionSort method in...Ch. 7.12 - What types of array can be sorted using the...Ch. 7.12 - To apply java.util.Arrays.binarySearch (array,...Ch. 7.12 - Show the output of the following code: int[] list1...Ch. 7.13 - This book declares the main method as public...Ch. 7.13 - Show the output of the following program when...Ch. 7 - (Assign grades) Write a program that reads student...Ch. 7 - (Reverse the numbers entered) Write a program that...Ch. 7 - (Count occurrence of numbers) Write a program that...Ch. 7 - (Analyze scores) Write a program that reads an...Ch. 7 - (Print distinct numbers) Write a program that...Ch. 7 - (Revise Listing 5.1 5, PrimeNumber.java) Listing...Ch. 7 - (Count single digits) Write a program that...Ch. 7 - (Average an array) Write two overloaded methods...Ch. 7 - (Find the smallest element) Write a method that...Ch. 7 - Prob. 7.10PECh. 7 - (Statistics: compute deviation) Programming...Ch. 7 - (Reverse an array) The reverse method in Section...Ch. 7 - Prob. 7.13PECh. 7 - Prob. 7.14PECh. 7 - 7 .15 (Eliminate duplicates) Write a method that...Ch. 7 - (Execution time) Write a program that randomly...Ch. 7 - Prob. 7.17PECh. 7 - (Bubble sort) Write a sort method that uses the...Ch. 7 - (Sorted?) Write the following method that returns...Ch. 7 - (Revise selection sort) In Listing 7 .8, you used...Ch. 7 - (Sum integers) Write a program that passes an...Ch. 7 - (Find the number of uppercase letters in a string)...Ch. 7 - (Game: locker puzzle) A school bas 100 lockers and...Ch. 7 - (Simulation: coupon collectors problem) Coupon...Ch. 7 - (Algebra: solve quadratic equations) Write a...Ch. 7 - (Strictly identical arrays) The arrays 1ist1 and...Ch. 7 - (Identical arrays) The arrays 1ist1 and 1ist2 are...Ch. 7 - (Math: combinations) Write a program that prompts...Ch. 7 - (Game: pick four cards) Write a program that picks...Ch. 7 - (Pattern recognition: consecutive four equal...Ch. 7 - (Merge two sorted Lists) Write the following...Ch. 7 - (Partition of a list) Write the following method...Ch. 7 - Prob. 7.33PECh. 7 - (Sort characters in a string) Write a method that...Ch. 7 - (Game: hangman) Write a hangman game that randomly...Ch. 7 - (Game: Eight Queens) The classic Eight Queens...Ch. 7 - Prob. 7.37PE
Knowledge Booster
Similar questions
- Show the steps for sorting 2, 6, 4, 1, 2, 4, 1, 4 using counting sort (first version) with additional arrays B and C. A 2 6 4 1 2 4 1 4 1 2 3 4 5 6 7 8arrow_forwardWrite the algorithm for Quick Sort and sort the following numbers using the samesorting technique.A= [ 20, 26,18, 22, 25,16, 13, 19,15]arrow_forward3. Using Bubble sort, sort the following values in an increasing order. 8,2,4,9,12,7,10arrow_forward
- Show, step by step, how counting sort works on 5,3,2,1,2,2,4,3arrow_forwardUse the bubble sort to sort 6, 2, 3, 1, 5, 4, showing the lists obtained at each steparrow_forwardNow implement Merge Sort, Heap Sort, and Quick Sort in C++ and perform the followingexperiment:1. Generate an Array A of 108 random numbers. Make its copies B and C. Sort A usingMerge Sort, B using Heap Sort, and C using Quick Sort.2. During the sorting process, count the total number of comparisons between array elements made by each algorithm. You may do this by using a global less-than-or-equal-to function to compare numbers, which increments a count variable each time it is called.3. Repeat this process 5 times to compute the average number of comparisons made byeach algorithm.4. Present these average counts in a table. These counts give you an indication of how thedifferent algorithms compare asymptotically (in big-O terms) for a large value of n.(b) Now compare the same algorithms in terms of practical time, i.e. the actual running time.Simply, repeat the previous example but use the chrono library to compute the actual timestaken by each algorithm, and report the average value…arrow_forward
- Consider the following list:18, 8, 38, 25, 45, 12, 74, 60, 30a. This list is to be sorted using the insertion sort algorithm . Show the list after five iterations of the for loop.b. Exactly how many key comparisons are executed during the first fiveiterations of the for loop?arrow_forwardConsider the following array of int values. [17, 11, 6, 22, -3, 8, 4, 22, 2, 35, -4, 10] Write the contents of the array after 4 passes of the outermost loop of selection sort. Assume selection sort is sorting slots from low-to-high Write the contents of the array during each of the the recursive calls of merge sort.arrow_forwardExplain Quick sort algorithms with the following set of integers {50 , 70, 60, 90, 40, 80, 10, 20 , 30}arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education