Write a function that can sort an array of numbers either in ascending or descending order.
the order is specified with the ascending input variable (1 = ascending, 0 = descending).
the function should return 1 if there are multiple instances of the same value in the array, or 0 if the
values are all unique. use the following function signature, where length is the size of the array:

People with high self-esteem: accept their strengths and weaknesses. believe that failed experiences are failures of their whole self. feel good about who they are only when they reach total success. need positive external experiences to counteract negative feelings that constantly plague them.

What is a point-in-time measurement of system performance?

Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?