Differences

This shows you the differences between two versions of the page.

--- 2014:order_notation_in_practice [2013/11/23 11:17] – jonjagger
+++ 2014:order_notation_in_practice [2016/06/11 14:05] (current) – external edit 127.0.0.1
@@ Line 6: / Line 6: @@
 **Duration**: 90 mins\\
 **Description**: \\
-Many of us are familiar with the 'Big O' order notation for giving an idea of the complexity of algorithms; for example the C++ std::sort function is described as 'N logN'.
+Many of us are familiar with the "Big O" order notation for giving an idea of the complexity of algorithms; for example the C++ std::sort function is described as "N logN".
 But sometimes this can seem a little unconnected to the task of actually writing code.\\
 \\