Counting Sort 1 Comparison Sorting Quicksort usually has a running time of nnn x log(n)log(n)log(n), but is there an algorithm that can sort even faster? In general, this is not possible. Most sorting algorithms are comparison sorts, i.e. they sort a list just by comparing the elements to one another. A comparison sort algorithm cannot beat nnn x log(n)log(n)log(n) (worst-case) running time, sin..

Diagonal Difference Given a square matrix, calculate the absolute difference between the sums of its diagonals. For example, the square matrix is shown below: 1 2 3 4 5 6 9 8 9 The left-to-right diagonal 1+5+9=151 + 5 + 9 = 151+5+9=15. The right to left diagonal 3+5+9=173 + 5 + 9 = 173+5+9=17. Their absolute difference is ∣15−17∣=2|15 - 17| = 2∣15−17∣=2. Function description Complete the diagona..

Lonely Integer Given an array of integers, where all elements but one occur twice, find the unique element. Example a=[1,2,3,4,3,2,1]a = [1, 2, 3, 4, 3, 2, 1]a=[1,2,3,4,3,2,1] The unique element is 4. Function Description Complete the lonelyinteger function in the editor below. lonelyinteger has the following parameter(s): int a[n]: an array of integers Returns int: the element that occurs only ..

Time Conversion Given a time in 12-hour AM/PM format, convert it to military (24-hour) time. Note: 12:00:00AM on a 12-hour clock is 00:00:00 on a 24-hour clock. 12:00:00PM on a 12-hour clock is 12:00:00 on a 24-hour clock. Example s = '12:01:00PM' Return '12:01:00'. s = '12:01:00AM' Return '00:01:00'. Function Description Complete the timeConversion functi..

Mini-Max Sum Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers. Then print the respective minimum and maximum values as a single line of two space-separated long integers. Example arr=[1,3,5,7,9]arr = [1, 3, 5, 7, 9]arr=[1,3,5,7,9] The minimum sum is 1 + 3 + 5 + 7 = 16 and the maximum sum is 3 + 5 + 7 + 9 = 24. T..

Plus Minus Given an array of integers, calculate the ratios of its elements that are positive, negative, and zero. Print the decimal value of each fraction on a new line with places after the decimal. Note: This challenge introduces precision problems. The test cases are scaled to six decimal places, though answers with absolute error of up to are acceptable. Example arr = [1, 1, 0, -1, -1] Ther..