title: O(1) minimum in a changing fixed size array
body: <p>I have an array with 32 numbers. Initially, every number is 0, although it's probably not important.</p>
  
  <p>At any time I can change one number in this array.</p>
  
  <p>I want to quickly find the minimum value and its index after such an update. Is there a way to do it in O(1) time?</p>