Implement the most ridiculous quick sort algorithm in the world which uses an insertion sort to partition the values. Your algorithm uses median of 3 to select a pivot. When it partitions based on the pivot, your algorithm does an insertion sort on the values to determine the values less than the pivot and greater than the pivot partitions. Solution requirements: • Use pseudocode as close to Java code (i.e. no English explanations) • You will be given partial points based on how: pseudocode usage, understanding of the problem shown in your code. • Show how your algorithm would sort a small example of 15 numbers on paper. Partial credit will be given based on the number of steps you show sorting the numbers.

Write an algorithm to sort elements in an array with selection sort in pseudocode. You will be given an array, and you need to sort the elements in ascending order. ps: Some things to keep in mind: sorting is not required if the given array has a length of 0 or 1. You should take care to ensure that you start with the smallest element, and swap it to the front of the array. From there, compare each successive element with all previous elements and place them correctly, repeating the process until it's all sorted. ======================================================================================= Write an algorithm to sort elements in an array with insertion sort in pseudocode. You will be given an array, and you need to sort the elements in ascending order. ======================================================================================= Write an algorithm to sort elements in an array with merge sort in pseudocode. You will be given an array, and you need to sort the elements…

Consider an array of integers. Write the pseudocode in Java for either the selection sort, insertion sort, or bubble sort algorithm. Include loop invariants in your pseudocode.   I need help with the above instruction for the bubble sort algorithm, please.  I appreciate your help. Thank you.

Using a Java program solve the following problem using arrays: Past A: Coupon collector is a classic statistic problem with many practical applications. The problem is to pick objects from a set of objects repeatedly and determine how many picks are needed for all the objects to be picked at least once. A variation of the problem is to pick cards from a shuffled deck of 52 cards repeatedly and find out how many picks are needed before you see one of each suit. Assume a picked card is placed back in the deck before picking another. Write a program to simulate the number of picks needed to get total of four cards from each different suit and display the four cards picked (it is possible that a card may be picked twice). Here is a sample run of the program: Queen of Spades 5 of Clubs Queen of Hearts 4 of Diamonds Number of picks: 12 Sample run explanation: As you see in the above run, 12 picks are made to get the four cards from different suits. The other 8 picks (12-4-8) were from the…