title: Writing a simple sorting algorithm in c++, along with a pseudo code version
body: <p>I'm trying to write a sorting algorithm of sorts in C++, and then write it up in pseudo code after which, now writing it in pseudo is not too bad, however getting it down in my head is turning into a struggle, so the question I pose to you guys:</p>
  
  <p>I'm looking to create an algorithm that takes an unsorted array,along with two integers(Lets say B AND C) and outputs TRUE, if A contains an element which is both greater than B and less than C, otherwise it returns FALSE.</p>
  
  <pre><code>For J &lt;-- 1 to Length[A]
         Count &lt;-- j+1
                while Count =&lt; Length[A]
  </code></pre>
  
  <p>This is my start for pseudo code, seeing as that seemed like the logical thing to start with, then implement it in c++, However I found myself going round in circles creating loops, and not making much progress. Hope everything I've said makes sense and someone can put it all together to create some form of solution. thanks.</p>