Give a linear-time algorithm to sort the ratios of n given pairs of integers between 1 and n. I. e., we need to sort, within O(n) time, n pairs of the form (ai , bi) where 1 ≤ ai ≤ n and 1 ≤ bi ≤ n using the sort key ai bi . Prove both run-time and correctness.

a variable of array type holds a reference of object

array are commonly used in computer program to organize data so that a related set of values

array are using zero base indexing it start with 0.

all component of array have same type, two different types doesn't use in single array

if array are store 10 quantities its index value varies from 0 to 9.

it stores 1st quantity value in index value 0 and this process will same till index value 9.

you are welcome for my answer it is b⇔⇒⊕

incoplete qest

explanation:

d?

explanation: