Subject - Design & Algorithm 2) Use Counting Sort algorithm to sort the array A = [1, 7, 2, 2, 2, 7, 3, 5]. (Note: You should perform the Counting Sort algorithm step-by-step and show your. Is the Counting Sort algorithm stable? Why?

Subject - Design and Algorithms Use Radix Sort algorithm to sort the array A = [765, 984, 109, 349, 653, 139, 810, 451, 690, 371].(Note: You must perform the Radix Sort algorithm step-by-step and show your clearly please)

1. (100 points) Write a Java program that ● ● ● Define an integer array with length of 10. Populate the array with random integer numbers. Sort this array into non-decreasing/decreasing order based on three sorting algorithms. bubble sort selection sort O insertion sort Test these 3 sorting methods Give a big-Oh characterization, in terms of n, of the running time of these three algorithms. Improve the bubble sort so that the time complexity of them are O(N) for the best case (extra

Computer Science TheoryAlgorithm and Data Structure Full Explanation