He then asked me a question that had been asked in Round 4, written test:Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons required in the worst case? Note that they didn’t ask the order in Big-Oh notation. They wanted the exact number of comparisons.