title: Bubble Sorting with Scheme
body: <p>I'm working on implementing a bubble sorting algorithm in Scheme, and I must say that the functional way of programming is a strange concept and I am struggling a bit to grasp it.</p>
  
  <p>I've successfully created a function that will bubble up the first largest value we come across, but that's about all it does. </p>
  
  <pre><code>(bubbleH '(5 10 9 8 7))
  (5 9 8 7 10)
  </code></pre>
  
  <p>I am struggling with the helper function that is required to completely loop through the list until no swaps have been made. </p>
  
  <p>Here's where I am at so far, obviously it is not correct but I think I am on the right track. I know that I could pass in the number of elements in the list myself, but I am looking for a solution different from that.</p>
  
  <pre><code>(define bubbaS
    (lambda (lst)
    (cond (( = (length lst) 1) (bubba-help lst))
        (else (bubbaS (bubba-help lst))))))
  </code></pre>