Capital One interview questions

You are given an array of integers *numbers* and an integer *pivot*. Let counterGreater denote how many integers within *numbers* are **strictly greater** than *pivot*, and *countLess* denote how many integers are **strictly less* than pivot. You task is to compute *countGreater* and *countLess*, then return: a. "greater" if *counterGreater* is greater than *countLess*: b. "smaller" if *countGreater* is less than *countLess*: c. *tie" if they are equal. Note You are not expected to provide the most optimal solution, but a solution with time complexity not worse than O(numbers.length^2) will fit within the execution time limit.