title: Quicksort in DrScheme
body: <p>I'm currently in the processes of learning functional languages such as Lisp and DrScheme, but I've been asked to write a variance of the Quicksort algorithm in DrScheme. However, I'm a bit clueless as where to start.</p>
  
  <p>Could someone give me some pointers as which functions and datatypes to use? I obviously know      lists, car, cdr, and append are going to play a huge part into what to do.</p>
  
  <p>By, the way, I'm only really looking for general idea to launch off from. I don't necessarily want the full answer. Kind of ruins the adventure and fun of it!</p>