title: Runtime of Algorithms In Various Programming Languages
body: <p>How would the run time of algorithms differ in various programming languages? For example, assuming that an algorithm's run time is stated as &Theta;(n<sup>2</sup>) , would it differ in any way if it were ran in Haskell, Java, C, etc.?</p>
  
  <p>EDIT: My question has been answered, but I would still like additional input if you guys have the time to spare. My professor is letting us do our own programming project for the quarter and this was an idea I came up with and I just want to make sure that there's enough for me to discuss. I am having second thoughts on this so if anyone else would like to suggest an idea(s) or modify/build upon this one, I'd greatly appreciate it.</p>