In Java: Consider an array of 100 integers, which are completely unsorted. Provide a code snippet that will find the largest number in the array and calculate the number of computational steps required. Please provide commentary for my understanding.