title: What is a "naive" algorithm, and what is a "closed - form" solution?
body: <p>I have a few questions regarding the semantics of terminology used when describing algorithms.</p>
  
  <p>Firstly, what is meant by a 'naive' algorithm? How does this differ from other solutions to a given problem? What other forms can solutions take?</p>
  
  <p>Secondly, I have heard much reference to having a 'closed - form' solution. I have no idea what this means either - but often it appears when trying to solve recurrence relations...</p>
  
  <p>Thanks for your time</p>