program that compares all four advanced sorting algorithms . To perform the tests, create a randomly generated array of 1,000 elements. What is the ranking of the algorithms? What happens when you increase the array size to 10,000

Write a program to accept 10 positive and negative values in an integer array. Program would shift all negative values to the left side and all positive values to the right side of the array without sorting them. Use Java coding Language.

Assume you are playing a card game using a standard 52-card deck. You are dealt a hand of cards that are all the same suit, spades. You are dealt first a 5, then a 3, then 8, and finally 4. You first took the 5 into your hand. Then you put the three before the 5. Next you put the 8 behind the 5. Finally, you put the 4 between the 3 and 5. Which sorting algorithm is most similar to how you sorted your hand?  Group of answer choices   1. Quick Sort 2. Insertion Sort 3. Merge Sort 4. Selection Sort