The Big-O Notation — Algorithm and Data Structure

Big-O?

Big O is the way we analyze how efficient algorithms (or code in this case) without getting too mired in the details. We can model how much any function is going to take given n inputs (thinking an array of length n), but in reality we’re interested in the order of magnitude of the number and not necessarily of the exact figure.

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Luis Castillo

Luis Castillo

Software Engineer / Full-Stack Developer in Ruby, Ruby on Rails, JavaScript, ReactJS, Redux, SQL, HTML5, CSS3