8 added 177 characters in body edited Dec 19 '19 at 17:56 Robert Harvey 180k4848 gold badges416416 silver badges624624 bronze badges The O(...) refers to Big-O notation, which is a simple way of describing how many operations an algorithm takes to do something. This is known as time complexity. In Big-O notation, the cost of an algorithm is represented by its most costly operation at large numbers. If an algorithm took `n3 + n2 + n` steps, it would be represented O(n3). An algorithm that counted each item in a list would operate in O(n) time, called linear time. For a list of the names and classic examples on Wikipedia: Orders of common functions Related material: The O(...) refers to Big-O notation, which is a simple way of describing how many operations an algorithm takes to do something. This is known as time complexity. In Big-O notation, the cost of an algorithm is represented by its most costly operation at large numbers. If an algorithm took `n3 + n2 + n` steps, it would be represented O(n3). An algorithm that counted each item in a list would operate in O(n) time, called linear time. For a list of the names and classic examples on Wikipedia: Orders of common functions Related material: The O(...) refers to Big-O notation, which is a simple way of describing how many operations an algorithm takes to do something. This is known as time complexity. In Big-O notation, the cost of an algorithm is represented by its most costly operation at large numbers. If an algorithm took `n3 + n2 + n` steps, it would be represented O(n3). An algorithm that counted each item in a list would operate in O(n) time, called linear time. For a list of the names and classic examples on Wikipedia: Orders of common functions Related material: 7 replaced http://stackoverflow.com/ with https://stackoverflow.com/ edited May 23 '17 at 12:40 The O(...) refers to Big-O notation, which is a simple way of describing how many operations an algorithm takes to do something. This is known as time complexity. In Big-O notation, the cost of an algorithm is represented by its most costly operation at large numbers. If an algorithm took `n3 + n2 + n` steps, it would be represented O(n3). An algorithm that counted each item in a list would operate in O(n) time, called linear time. For a list of the names and classic examples on Wikipedia: Orders of common functions Related material: The O(...) refers to Big-O notation, which is a simple way of describing how many operations an algorithm takes to do something. This is known as time complexity. In Big-O notation, the cost of an algorithm is represented by its most costly operation at large numbers. If an algorithm took `n3 + n2 + n` steps, it would be represented O(n3). An algorithm that counted each item in a list would operate in O(n) time, called linear time. For a list of the names and classic examples on Wikipedia: Orders of common functions Related material: The O(...) refers to Big-O notation, which is a simple way of describing how many operations an algorithm takes to do something. This is known as time complexity. In Big-O notation, the cost of an algorithm is represented by its most costly operation at large numbers. If an algorithm took `n3 + n2 + n` steps, it would be represented O(n3). An algorithm that counted each item in a list would operate in O(n) time, called linear time. For a list of the names and classic examples on Wikipedia: Orders of common functions Related material: 6 replaced http://cs.stackexchange.com/ with https://cs.stackexchange.com/ edited Apr 13 '17 at 12:48 The O(...) refers to Big-O notation, which is a simple way of describing how many operations an algorithm takes to do something. This is known as time complexity. In Big-O notation, the cost of an algorithm is represented by its most costly operation at large numbers. If an algorithm took `n3 + n2 + n` steps, it would be represented O(n3). An algorithm that counted each item in a list would operate in O(n) time, called linear time. For a list of the names and classic examples on Wikipedia: Orders of common functions Related material: The O(...) refers to Big-O notation, which is a simple way of describing how many operations an algorithm takes to do something. This is known as time complexity. In Big-O notation, the cost of an algorithm is represented by its most costly operation at large numbers. If an algorithm took `n3 + n2 + n` steps, it would be represented O(n3). An algorithm that counted each item in a list would operate in O(n) time, called linear time. For a list of the names and classic examples on Wikipedia: Orders of common functions Related material: The O(...) refers to Big-O notation, which is a simple way of describing how many operations an algorithm takes to do something. This is known as time complexity. In Big-O notation, the cost of an algorithm is represented by its most costly operation at large numbers. If an algorithm took `n3 + n2 + n` steps, it would be represented O(n3). An algorithm that counted each item in a list would operate in O(n) time, called linear time. For a list of the names and classic examples on Wikipedia: Orders of common functions Related material: Post Made Community Wiki by Thomas Owens♦ occurred Oct 26 '15 at 19:24 5 Pull in some of the comments. Clean up format. edited Jul 21 '15 at 13:53 user40980 4 added 146 characters in body edited Jul 21 '15 at 13:53 Thomas Owens♦ 65.4k1414 gold badges160160 silver badges244244 bronze badges 3 Clean up link. Reword temporal information. edited Jul 21 '15 at 13:37 user40980 2 Added link to Stanford course edited Jan 29 '12 at 6:53 MaxGabriel 57855 silver badges99 bronze badges 1 answered Jan 29 '12 at 6:43 MaxGabriel 57855 silver badges99 bronze badges