Write a sort method that uses the bubble-sort algorithm. The bubble-sort algorithm makes several passes through the array. On each pass, successiveneighboring pairs are compared. If a pair is not in order, its values areswapped; otherwise, the values remain unchanged. The technique is called abubble sort or sinking sort because the smaller values gradually “bubble” theirway to the top, and the larger values “sink” to the bottom. Write a test programthat reads in 10 double numbers, invokes the method, and displays the sortednumbers.

Write a sort method that uses the bubble-sort algorithm. The bubble-sort algorithm makes several passes through the array. On each pass, successiveneighboring pairs are compared. If a pair is not in order, its values areswapped; otherwise, the values remain unchanged. The technique is called abubble sort or sinking sort because the smaller values gradually “bubble” theirway to the top, and the larger values “sink” to the bottom. Write a test programthat reads in 10 double numbers, invokes the method, and displays the sortednumbers.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

Write the following methodthat tests whether the array has four consecutive numbers with the same value:public static boolean isConsecutiveFour(int[] values)Write a test program that prompts the user to enter a series of integers and displaysit if the series contains four consecutive numbers with the same value. Yourprogram should first prompt the user to enter the input size—i.e., the number ofvalues in the series. Here are sample runs: Enter the number of values: 8↵EnterEnter the values: 3 4 5 5 5 5 4 5↵EnterThe list has consecutive foursEnter the number of values: 9↵EnterEnter the values: 3 4 5 5 6 5 5 4 5↵EnterThe list has no consecutive fours
Exercise 1: Write a program that generates a sequence of 20 random values between 0 and 99 in an array, prints the sequence, sorts it, and prints the sorted sequence. Use the sort method from the standard Java library. Exercise 2: Write a program that stores a list of countries: "Egypt", "Switzerland", "Argentina", "Spain", "Portugal", "Luxemburg", etc. Initialize your array with a single statement. Then print out the array. Use the sort function as before to sort the countries in alphabetical order. Reprint your array. Exercise 3: Implement exercises 1 and 2 using ArrayList. Use the Collections.sort method for sorting. After you have printed and sorted your results, then append an additional element to each list and reprint your ArrayLists. Notice that the new items will appear just at the end and will not be sorted. Resort and print out the new ArrayLists again. To clarify, you should print out your ArrayLists after your first sort, after adding items with the…
Write a hangman game that randomly generates a word andprompts the user to guess one letter at a time, as presented in the sample run.Each letter in the word is displayed as an asterisk. When the user makes a correctguess, the actual letter is then displayed. When the user finishes a word, displaythe number of misses and ask the user whether to continue to play with anotherword. Declare an array to store words, as follows:// Add any words you wish in this arrayString[] words = {"write", "that",...}; (Guess) Enter a letter in word ******* > p↵Enter(Guess) Enter a letter in word p****** > r↵Enter(Guess) Enter a letter in word pr**r** > p↵Enterp is already in the word(Guess) Enter a letter in word pr**r** > o↵Enter(Guess) Enter a letter in word pro*r** > g↵Enter(Guess) Enter a letter in word progr** > n↵Entern is not in the word(Guess) Enter a letter in word progr** > m↵Enter(Guess) Enter a letter in word progr*m > a↵EnterThe word is program. You missed 1 timeDo…
Task 05: An r-combination of elements of a set is an unordered selection of r elements from the set. Thus, an r-combination is simply a subset of the set with r elements. Given an array of size n, generate and print all possible combinations of r elements in array. hint, if input array is (1, 2, 3, 4} and r is 3, then output should be: 123 124 134 234
Write a sort function that uses the bubble-sort algorithm. The bubble-sort algorithm makes several passes through the list. On each pass, successive neighboring pairs are compared. If a pair is in decreasing order, its values are swapped; otherwise, the values remain unchanged. The technique is called a bubble sort or sinking sort because the smaller values gradually “bubble” their way to the top and the larger values “sink” to the bottom. Write a test program that reads in ten numbers, invokes the function, and displays the sorted numbers.
Hint: You can use any of these coaching to generate a random integer. Math ii. Random three Sort the array of random chars (using Arrays.sort()), and print out the ordered array the use of a for each loop 4 Implement a Linear Search to find out key in the random array of ints a. Use the unsorted array b. Keep music of the vary of comparisons that are made with this algorithm 5. Implement a Binary Search to find out key in the random array of chars a. Remember, you will have to make positive that the array is in ascending order in the past than trying to run a binary search. i. b. Keep track of the extensive range of comparisons that are made with this algorithm. e Include a observation interior your software program explaining WHY arrays want to be sorted in order to use binary search d. Generate output for the user. You need to include: Assignment: Write a complete Java software program that will search a random persona array for a key (A-2), and return the vary of searches completed…
Simulate binary search Use array {1, 2, 3, 4, 5, 6, 7} to simulate binary search of 3. For each iteration, you need to write down the value of first, last, and middle after the execution of this statement: middle = (first + last) / 2 follow the loop until you get the search result. After you are done, update the BinarySearchDemo.java class to use this array for search. Compare the print out result to your simulation result.
Java Programming : At a fun fair, a street vendor is selling different colours of balloons. He sells N number of different colours of balloons (B[]). The task is to find the colour (odd) of the balloon which is present odd number of times in the bunch of balloons. Note: If there is more than one colour which is odd in number, then the first colour in the array which is present odd number of times is displayed. The colours of the balloons can all be either upper case or lower case in the array. If all the inputs are even in number, display the message 'All are even'. Example 1: 7 -> Value of N [r,g,b,b,g,y,y] -> B[] Elements B[0] to B[N-1], where each input element is separated by new line. Output: r -> [r,g,b,b,g,y.y] →> 'r' colour balloon is present odd number of times in the bunch. Explanation: From the input array above: r: 1 balloon g: 2 balloons b: 2 balloons y: 2 balloons Hence, r is only the balloon which is odd in number.
Phase 1: Execution time for Sorting Write a program that obtains the execution time of selection sort, bubble sort, merge sort, quick sort, heap sort, and radix sort for input size 50,000, 100,000, 150,000, 200,000, 250,000, and 300,000. Create a method or class for each sorting algorithm and call them from the main(). Your program should create data randomly and print a table like this: Array size 100,000 200,000 300,000 Insertion Sort Bubble Sort Merge Sort Quick Sort Heap Sort Radix Sort (HINT: You can use the following code template to obtain the execution time.) long startTime = System.nanoTime(); perform the task; long endTime = System.nanoTime(); long executionTime = endTime − startTime;
Write code that loops through the array myVals. Each iteration: If myVals[i] is less than smallestNum, assign smallestNum with myVals[i]. Remember to assign smallestNum with some value before the loop.
CodeWorkout Gym Course Search exercises... Q Search kola_shreya@columbusstate.edu X173: array220 Given an array of int 5, compute recursively if the array contains somewhere a value followed immediately by that same value times 10. We'll use the convention of considering only the part of the array that begins at the given index.In this way, a recursive call can pass index + 1 to move down the array. The initial call will pass in an index position of 0. Your Answer: 1 public boolean array220(int[] nums, int index) 4} Check my answer! Reset Next exercise Feedbacz CodeWorkout © Virginia Tech About License Privacy Contact H 2 M 45
A chess has ABCD andEstudents. They take a test for 100 points. Write a program which takes input of test scores fiom the gouder and gives the letter grade for the students and the averye score of the class. Use Array \& loop.