need help in computer science the design and analysis of algorithms

ALGORITHM AlgoName(Parameter 1, Parameter 2, ...) //Description:...... //Input: .... //Output:.... Steps ....

Consider the sorting algorithm listed on Page 23 Exercise 1.3. #1. a. Apply this algorithm to sorting the list 15, 81, 39, 65, 21, 42, 39, 23. Show each step. b. Is this algorithm stable? c. Is it in-place?

1. Consider the algorithm for the sorting problem that sorts an array by counting, for each of its elements, the number of smaller elements and then uses this information to put the element in its appropriate position in the sorted array: ALGORITHM Comparison Counting Sort(A[O..n - 1]) //Sorts an array by comparison counting //Input: Array A[O..n - 1] of orderable values I/Output: Array S[0..n - 1] of A's elements sorted 11 in nondecreasing order for it to n - 1 do Count[i]