Big O Notation: What It Is and Why You Should Care

Big O Notation: What It Is and Why You Should Care Time complexity is a way of discussing how long specific algorithms take. This is useful in streamlining software so it works as fast as possible. When you’re writing code, you should be aware of how long it’s going to take to execute. Nobody wants to create a product that users find frustrating due to slow use. Time complexity is talked about in relation to an algorithm, a collection of one or more functions. Big O Notation specifically helps you identify when an algorithm wouldn’t ’scale’ well, or work well with varying amounts of users, information, or other inputs. This does NOT correspond with Moore’s law - no matter how big and fast your computer is, if the algorithm is exponentially inefficient, it’s realistically unusable. A ... #JavaScript #Web_Development_Tools_(Organization_Sector) #Free_Code_Camp #Pair_Programming # #AngularJS #MongoDB #SQL #Code 20150921 KSNx22U4uWE