This week's book giveaway is in the OCPJP forum. We're giving away four copies of OCA/OCP Java SE 7 Programmer I & II Study Guide and have Kathy Sierra & Bert Bates on-line! See this thread for details.
To figure this one out think about the actual process you would use in your head to determine which one is the lowest. You start by taking the first number and storing it in your memory. You then compare each of the other numbers in the array to the one stored in memory. If it's lower you update your memory with the lower one and continue on until you find another lower one. If you don't find another lower one by the time you are done - you have found the lowest number. Hope that helps.