title: C to MIPS convert
body: <p>Can anyone help me convert the C code below to MIPS code? I'm supposed to use recursion and get 21 - 2 as the final answer. Thanks!</p>
  
  <pre><code>/*
  x is a pointer to a linked list node and is not null.
  Return the min value stored in the linked list.
  
  Assume each node is stored in memory as an int (value) followed by a pointer to the next node (next), each a word wide.
  You must write it with recursion.  */
  
  int findMin(node *x) {
      if(x-&gt;next == NULL)
          return x-&gt;value;
      else {
          int min = findMin(x-&gt;next);
          if(min &lt; x-&gt;value) 
              return min;
          else
              return x-&gt;value;
      }
  }
  </code></pre>