Consider the following algorithm for finding the distance between the two closest elements in an array of numbers. ALGORITHM MinDistance(A[0..n-1])
//Input: Array (A[0..n-1]) of numbers
//Output: Minimum distance between two of its elements
dmin ← [infinity]

for i ← 0 to n - 1 do
for j ← 0 to n - 1 do
if i ≠ j and |A[i] - A[j]| < dmin
dmin ← |A[i] - A[j]|
return dmin

Make as many improvements as you can in this algorithmic solution to the problem. (If you need to, you may change the algorithm altogether, if not, improve the implementation given.)

3.12: the speed of sound the speed of sound depends on the material the sound is passing through. below is the approximate speed of sound (in feet per second) for air, water and steel: air: 1,100 feet per second water: 4,900 feet per second steel: 16,400 feet per second write a program class the speed of sound that asks the user to enter “air”, “water”, or “steel”, and the distance that a sound wave will travel in the medium. the program should then display the amount of time it will take. you can calculate the amount of time it takes sound to travel in air with the following formula: time = distance/1,100 you can calculate the amount of time it takes sound to travel in water with the following formula: time = distance/4,900 you can calculate the amount of time it takes sound to travel in steel with the following formula: time = distance/16,400