title: Racket: Compare elements in list recursively
body: <p>This function is supposed to take a list (full of strings or ints, which is why it starts with that 'if' statement) and check to see if it is in ascending order. </p>
  
  <p>I haven't been able to figure out how to keep it from crashing, as on the last recursive call, the 'cadr' has nothing to pull from, as the 'car' is the final element. </p>
  
  <pre><code>(define (my-sorted? lst)  
     (if (number? (car lst))
       (if (&lt; (car lst) (cadr lst))
          (my-sorted? (rest lst))      
           #f)     
       #f) 
   )
  </code></pre>
  
  <p>I know that the sorted function exists, but I need to implement this function recursively. </p>
  
  <p>Thanks for any help.</p>