{"id":7081774,"date":"2026-11-15T11:57:04","date_gmt":"2026-11-15T11:57:04","guid":{"rendered":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774"},"modified":"2026-11-15T11:57:04","modified_gmt":"2026-11-15T11:57:04","slug":"big-o-examples-in-c-2","status":"publish","type":"post","link":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774","title":{"rendered":"Big O Examples in C++"},"content":{"rendered":"<p> <br \/>\n<\/p>\n<div id=\"postBody\">\nBig O notation describes how an algorithm\u2019s running time or space usage grows as<br \/>\nthe input size \ud835\udc5b n increases.\u00a0<\/p>\n<p>In C++, you can see common Big O classes like \ud835\udc42(1), \ud835\udc42(log \ud835\udc5b), \ud835\udc42(\ud835\udc5b), \ud835\udc42(\ud835\udc5b log \ud835\udc5b), and \ud835\udc42(\ud835\udc5b<sup>2<\/sup>) in simple code patterns and STL operations.\u00a0<\/p>\n<div class=\"separator\" style=\"clear: both; text-align: center;\"><a href=\"https:\/\/media.licdn.com\/dms\/image\/v2\/D4E10AQFyi5d458qZxQ\/image-shrink_800\/image-shrink_800\/0\/1734626710419?e=2147483647&amp;v=beta&amp;t=TYxuYmnC6Z4Nyq1dKAm_4qhqyXl_crkJ3J7bqTlx7ZI\" imageanchor=\"1\" style=\"margin-left: 1em; margin-right: 1em;\"><img decoding=\"async\" border=\"0\" data-original-height=\"1040\" data-original-width=\"800\" height=\"1040\" loading=\"lazy\" src=\"https:\/\/media.licdn.com\/dms\/image\/v2\/D4E10AQFyi5d458qZxQ\/image-shrink_800\/image-shrink_800\/0\/1734626710419?e=2147483647&amp;v=beta&amp;t=TYxuYmnC6Z4Nyq1dKAm_4qhqyXl_crkJ3J7bqTlx7ZI\" width=\"800\"\/><\/a><\/div>\n<h2 style=\"text-align: left;\">Common Big O classes with C++ examples<\/h2>\n<h4 style=\"text-align: left;\">\ud835\udc42(1) \u2013 Constant time<\/h4>\n<p><b>The runtime does not depend on input size.<\/b><\/p>\n<div>\n<pre data-comment=\"cpp\"><code>\n\/\/ Accessing an array element by index\nint arr[1000];\nint x = arr[5];  \/\/ O(1)\n\n\/\/ Simple arithmetic \/ assignment\nint y = a + b;           \/\/ O(1)\nbool equal = (a == b);   \/\/ O(1)\n\n\/\/ Push\/back on vector (amortized)\nstd::vector<int> v;\nv.push_back(10);  \/\/ amortized O(1)<\/int><\/code><\/pre>\n<p>Typical \ud835\udc42(1) patterns: single statements, no loops depending on \ud835\udc5b, direct index access, basic arithmetic.\n<\/p><\/div>\n<h4 style=\"text-align: left;\">\ud835\udc42(\ud835\udc5b) \u2013 Linear time\u00a0<\/h4>\n<h4 style=\"text-align: left;\">\n  Runtime grows proportionally with \ud835\udc5b usually a single loop over all<br \/>\n  elements.\u00a0<br \/>\n<\/h4>\n<pre data-comment=\"cpp\"><code>\/\/ Sum of first n integers (loop version)\nint sumOfNumbers(int n) {\n    int sum = 0;\n    for (int i = 1; i &lt;= n; ++i) {  \/\/ runs n times\n        sum += i;                    \/\/ O(1) work each time\n    }\n    return sum;                      \/\/ overall O(n)\n}\n\n\/\/ Linear search in an array\nint linearSearch(const int arr[], int n, int target) {\n    for (int i = 0; i &lt; n; ++i) {   \/\/ up to n iterations\n        if (arr[i] == target)\n            return i;\n    }\n    return -1;                       \/\/ O(n)\n}\n\n\/\/ Traversing a vector\nstd::vector<int> v = {1,2,3,4,5};\nfor (int x : v) {                   \/\/ n elements\n    std::cout &lt;&lt; x &lt;&lt; \" \";          \/\/ O(1) per element\n}                               \/\/ total O(n)<\/int><\/code><\/pre>\n<p style=\"text-align: left;\">\n    Patterns: one loop from 0 to \ud835\udc5b\u22121, iterating over a container once.\u00a0\n  <\/p>\n<h4 style=\"text-align: left;\">\ud835\udc42(log \ud835\udc5b) \u2013 Logarithmic time\u00a0<\/h4>\n<p style=\"text-align: left;\">\n  <b>Runtime grows with the number of times you can halve the problem; classic<br \/>\n    example is binary search.\u00a0<\/b>\n<\/p>\n<pre data-comment=\"cpp\"><code>\/\/ Binary search on a sorted array (iterative)\nint binarySearch(const int arr[], int n, int target) {\n    int left = 0, right = n - 1;\n    while (left &lt;= right) {                 \/\/ each step halves the range\n        int mid = left + (right - left) \/ 2;\n        if (arr[mid] == target) return mid;\n        if (arr[mid] &lt; target) left = mid + 1;\n        else right = mid - 1;\n    }\n    return -1;                              \/\/ O(log n)\n}\u00a0<\/code><\/pre>\n<p style=\"text-align: left;\">\n  <b>Also common in C++ STL:<\/b><br \/>\n  <code>std::lower_bound, std::upper_bound, std::binary_search<\/code> on sorted<br \/>\n  ranges are \ud835\udc42(log \ud835\udc5b).\n<\/p>\n<h4 style=\"text-align: left;\">\n  \ud835\udc42 ( \ud835\udc5b log \u2061 \ud835\udc5b )\u00a0 \u2013 Linearithmic time\u00a0<br \/>\n<\/h4>\n<p style=\"text-align: left;\">\n  Typical for <a href=\"https:\/\/www.openglprojects.in\/2012\/04\/dynamic-sorting-algorithm-visualizer.html\" target=\"_blank\">efficient sorting<\/a> and some divide-and-conquer algorithms.\u00a0\n<\/p>\n<pre data-comment=\"cpp\"><code>#include \n#include \n\nstd::vector v = {5, 2, 9, 1, 5, 6};\nstd::sort(v.begin(), v.end());  \/\/ introsort: average O(n log n)<\/code><\/pre>\n<p>Most comparison-based sorts in C++ (std::sort, std::stable_sort) are \ud835\udc42 ( \ud835\udc5b log \ud835\udc5b<br \/>\n) on average. \ud835\udc42 ( \ud835\udc5b 2 )  \u2013 Quadratic time Usually nested loops<br \/>\nwhere both depend on \ud835\udc5b n; common in naive sorting algorithms.<\/p>\n<pre data-comment=\"cpp\"><code>\n\/\/ Bubble sort (worst\/average case)\nvoid bubbleSort(int arr[], int n) {\n    for (int i = 0; i &lt; n - 1; ++i) {          \/\/ ~n times\n        for (int j = 0; j &lt; n - i - 1; ++j) {  \/\/ ~n times\n            if (arr[j] &gt; arr[j + 1]) {\n                std::swap(arr[j], arr[j + 1]); \/\/ O(1)\n            }\n        }\n    }                                          \/\/ total O(n<sup>2<\/sup>)<br\/>}\n\n\/\/ Simple double loop example\nfor (int i = 0; i &lt; n; ++i) {        \/\/ n\n    for (int j = 0; j &lt; n; ++j) {    \/\/ n\n        std::cout &lt;&lt; i &lt;&lt; \" \" &lt;&lt; j;  \/\/ O(1)\n    }                                \/\/ n * n = O(n<sup>2<\/sup>)\n}<\/code><\/pre>\n<p>Also: worst-case of insertion sort and selection sort are<br \/>\n\ud835\udc42(\ud835\udc5b<sup>2<\/sup>).\u00a0<\/p>\n<h4 style=\"text-align: left;\">\ud835\udc42(2<sup>\ud835\udc5b<\/sup>)\u2013 Exponential time\u00a0<\/h4>\n<div>\n  Common in naive recursive solutions like Fibonacci without memoization.<\/p>\n<pre data-comment=\"cpp\"><code>\n\/\/ Naive recursive Fibonacci\nint fib(int n) {\n    if (n &lt;= 1) return n;          \/\/ base case O(1)\n    return fib(n - 1) + fib(n - 2); \/\/ each call branches into 2\n}                                  \/\/ roughly O(2<sup>n<\/sup>)<\/code><\/pre>\n<p>  Each increment of \ud835\udc5b roughly doubles the number of calls.<\/p>\n<h2>Big O of common C++ STL operations<\/h2>\n<p>  These are useful \u201creal-world\u201d examples when analyzing C++ code:\u00a0\n<\/p><\/div>\n<p><code data-highlighted=\"yes\">std::vector:\u00a0<\/code><\/p>\n<div>\n<ul style=\"text-align: left;\">\n<li>operator[], at(): \ud835\udc42 ( 1 )\u00a0<\/li>\n<li>push_back: amortized \ud835\udc42 ( 1 )\u00a0<\/li>\n<li>insert\/erase in the middle: \ud835\udc42 ( \ud835\udc5b )\u00a0<\/li>\n<\/ul>\n<\/div>\n<p><code data-highlighted=\"yes\">std::vector:\u00a0<\/code><code data-highlighted=\"yes\">std::array:\u00a0<\/code><\/p>\n<div>\n<ul style=\"text-align: left;\">\n<li>\u00a0Index access: \ud835\udc42 ( 1 )\u00a0<\/li>\n<\/ul>\n<\/div>\n<p><code data-highlighted=\"yes\">std::list<\/code> (doubly linked list):\u00a0<\/p>\n<div>\n<ul style=\"text-align: left;\">\n<li>\u00a0Insert\/erase at known iterator: \ud835\udc42 ( 1 )<\/li>\n<li>\u00a0Traversal to find an element: \ud835\udc42 ( \ud835\udc5b )\u00a0<\/li>\n<\/ul>\n<\/div>\n<p><code data-highlighted=\"yes\">std::unordered_set,<\/code><code data-highlighted=\"yes\">std::unordered_map:\u00a0<\/code> <\/p>\n<div>\n<ul style=\"text-align: left;\">\n<li>Average insert\/lookup\/erase: \ud835\udc42 ( 1 )\u00a0<\/li>\n<li>Worst case (bad hash): \ud835\udc42 ( \ud835\udc5b )\u00a0\u00a0<\/li>\n<\/ul>\n<\/div>\n<p><code data-highlighted=\"yes\">std::set<\/code>, <code data-highlighted=\"yes\">std::map<\/code> (balanced BST):\u00a0<\/p>\n<div>\n<ul style=\"text-align: left;\">\n<li>Insert\/lookup\/erase: \ud835\udc42 ( log \u2061 \ud835\udc5b )\u00a0\u00a0<\/li>\n<\/ul>\n<\/div>\n<p><code data-highlighted=\"yes\">std::sort<\/code>, <code data-highlighted=\"yes\">std::stable_sort:<\/code>\u00a0<\/p>\n<div>\n<ul style=\"text-align: left;\">\n<li>Average: \ud835\udc42 ( \ud835\udc5b log \u2061 \ud835\udc5b )\u00a0<\/li>\n<li>\n      Worst case for <code data-highlighted=\"yes\" data-result-language=\"css\">&lt;<span class=\"hl-selector-tag\">std::sort: <\/span>&gt;<\/code>typically \ud835\udc42 ( \ud835\udc5b log \u2061 \ud835\udc5b )  with<br \/>\n      introsort<\/li>\n<\/ul>\n<\/div>\n<h2>Practical Big O Examples in C++<\/h2>\n<p>  Presenting Few Simple Examples in C++ for <a href=\"https:\/\/www.openglprojects.in\/2026\/09\/computer-sciencebig-o-notation-practice-problems.html\">Big O Notation<\/a><\/p>\n<div class=\"table sticky bordered stripped hovered\">\n<table>\n<thead>\n<tr>\n<th>Complexity<\/th>\n<th>Example<\/th>\n<th>Evaluation<\/th>\n<\/tr>\n<\/thead>\n<tbody>\n<tr>\n<th>O(1)<\/th>\n<td>Addition of a + b<\/td>\n<td>A fixed number of operations regardless of input size<\/td>\n<\/tr>\n<tr>\n<th>O(n)<\/th>\n<td>Loop from 0 to n-1<\/td>\n<td>Loop executes n times<\/td>\n<\/tr>\n<tr>\n<th>O(log n)<\/th>\n<td>Binary search<\/td>\n<td>Search space is roughly halved each iteration<\/td>\n<\/tr>\n<tr>\n<th>O(n\u00b2)<\/th>\n<td>Two nested loops<\/td>\n<td>n \u00d7 n = n\u00b2 iterations<\/td>\n<\/tr>\n<tr>\n<th>O(n\u00b3)<\/th>\n<td>Three nested loops<\/td>\n<td>n \u00d7 n \u00d7 n = n\u00b3 iterations<\/td>\n<\/tr>\n<tr>\n<th>O(2\u207f)<\/th>\n<td>Naive recursive Fibonacci<\/td>\n<td>More precisely, its running time is O(\u03c6\u207f), often simplified to O(2\u207f)<\/td>\n<\/tr>\n<tr>\n<th>O(n!)<\/th>\n<td>Recursive factorial<\/td>\n<td>The recursive factorial is O(n), not O(n!)<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<h3 style=\"text-align: left;\">Evaluation\u00a0<\/h3>\n<p><b>\u00a01. O(1) \u2014 Constant<\/b><\/p>\n<div>\n<pre data-comment=\".cpp\"><code>cin &gt;&gt; a &gt;&gt; b;\u00a0 <br\/>cout &lt;&lt; a + b;\u00a0<\/code><\/pre>\n<p>There is a fixed amount of work, so:\u00a0<\/p>\n<p><b>\u00a0Time = O(1)\u00a0<\/b><\/p>\n<p>\u00a0Even if the values of <b>a<\/b> and <b>b <\/b>are very large, the number of program steps doesn&#8217;t depend on n.<\/p>\n<p>\u00a0<\/p>\n<p><b>2. O(n) \u2014 Linear\u00a0<\/b><\/p>\n<p>\u00a0<\/p>\n<div>\n<pre data-comment=\".cpp\"><code> for (int i = 0; i &lt; n; ++i) {\n    cout &lt;&lt; i &lt;&lt; \" \";\n}\u00a0<\/code><\/pre>\n<\/div>\n<p>The loop executes n times.\u00a0<\/p>\n<p><b>Time = O(n)\u00a0<\/b><\/p>\n<p><b>3. O(log n) \u2014 Logarithmic<\/b><\/p>\n<p>The binary search is a good example:\u00a0<\/p>\n<pre data-comment=\".cpp\"><code>while (left &lt;= right) {\u00a0\u00a0<br\/><span>\u00a0\u00a0 \u00a0<\/span>int mid = left + (right - left) \/ 2;<br\/><span>\u00a0\u00a0 \u00a0<\/span>...<br\/>}\u00a0<\/code><\/pre>\n<p>Every iteration eliminates approximately half of the remaining elements.\u00a0<\/p>\n<p>For example:\u00a0<\/p>\n<p><b>1000 \u2192 500 \u2192 250 \u2192 125 \u2192 &#8230; \u2192 1\u00a0<\/b><\/p>\n<p>So:\u00a0<\/p>\n<p><b>Time = O(log n)\u00a0<\/b><\/p>\n<p>One minor issue: your array contains only 7 elements, so technically that particular program has a fixed-size input and could be viewed as O(1). To demonstrate <b>O(log n)<\/b> properly, use an array whose size depends on <b>n<\/b>.\u00a0<\/p>\n<p><b>4. O(n\u00b2) \u2014 Quadratic<\/b><\/p>\n<div>\n<pre data-comment=\".cpp\"><code>for (int i = 1; i &lt;= n; ++i) {\n    for (int j = 1; j &lt;= n; ++j) {\n        ...\n    }\n}\u00a0<\/code><\/pre>\n<\/div>\n<p>\u00a0The inner loop runs n times for every one of the n outer iterations:\u00a0<\/p>\n<p>\u00a0<b>n \u00d7 n = n\u00b2\u00a0<\/b><\/p>\n<p>\u00a0<\/p>\n<p>Therefore:\u00a0<\/p>\n<p><b>Time = O(n\u00b2)\u00a0<\/b><\/p>\n<p><b>5. O(n\u00b3) \u2014 Cubic<\/b>\u00a0\u00a0<\/p>\n<p>You have three nested loops:\u00a0<\/p>\n<p>for (int i = 1; i &lt;= n; ++i)<br \/>\n    for (int j = 1; j &lt;= n; ++j)<br \/>\n        for (int k = 1; k &lt;= n; ++k)<\/p>\n<p>That&#8217;s:<\/p>\n<p><b>\u00a0n \u00d7 n \u00d7 n = n\u00b3\u00a0<\/b><\/p>\n<p>Therefore:\u00a0<\/p>\n<p><b>Time = O(n\u00b3)\u00a0<\/b><\/p>\n<p><b>6. O(2\u207f) \u2014 Exponential\u00a0<\/b><\/p>\n<p>The Fibonacci example &#8211; A simple recursive algorithm that makes two recursive calls at each level:\u00a0<\/p>\n<div>\n<pre data-comment=\".cpp\"><code>#include <iostream><br\/>using namespace std;<br\/>\u00a0\nint fibonacci(int n) {\u00a0<div><span>\u00a0\u00a0 \u00a0<\/span>if (n &lt;= 1) {\u00a0<p><span>\u00a0\u00a0 \u00a0<span>\u00a0\u00a0 \u00a0<\/span><\/span>return n;\u00a0<\/p><p><span>\u00a0\u00a0 \u00a0<\/span>}\u00a0<\/p><p><span>\u00a0\u00a0 \u00a0<\/span>return fibonacci(n - 1) + fibonacci(n - 2);\u00a0<\/p><p>} <\/p>int main(){\u00a0<p><span>\u00a0\u00a0 \u00a0<\/span>int n;\u00a0<\/p><p><span>\u00a0\u00a0 \u00a0<\/span>cin &gt;&gt; n;\u00a0<\/p><p><span>\u00a0\u00a0 \u00a0<\/span>cout &lt;&lt; \"Fibonacci of \" &lt;&lt; n &lt;&lt; \" is: \"\u00a0<\/p><p><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span>&lt;&lt; fibonacci(n) &lt;&lt; endl;\u00a0<\/p><p><span>\u00a0\u00a0 <span>\u00a0<\/span><\/span>cout &lt;&lt; \"This is O(2^n) - Exponential Complexity\";<\/p><\/div><\/iostream><\/code><\/pre>\n<\/div>\n<div>\n<p><b>O(2\u207f)<\/b> Commonly used simplified bound for this basic Big O Examples in C++<\/p>\n<p><b><\/p>\n<p>7. O(n!) \u2014 Factorial\u00a0<\/b><\/p>\n<p>To actually demonstrate O(n!), generate all permutations of n elements:<\/p>\n<div>\n<pre data-comment=\".cpp\"><code>#include\u00a0<iostream><br\/>#include\u00a0<vector><div>#include\u00a0<algorithm>\nusing namespace std;\u00a0<p>void generatePermutations(vector<int>&amp; arr, int index) { <\/int><\/p><p><span>\u00a0\u00a0 \u00a0<\/span>if (index == arr.size()) { <\/p><p><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span>for (int x : arr) { <\/p><p><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span>cout &lt;&lt; x &lt;&lt; \" \"; <\/p><p><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span>} <\/p><p><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span>cout &lt;&lt; endl; <\/p><p><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span>return; } <\/p><p><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span>for (int i = index; i &lt; arr.size(); ++i){ <\/p><p><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span>swap(arr[index], arr[i]); <\/p><p><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span>generatePermutations(arr, index + 1); <\/p><p><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span>swap(arr[index], arr[i]);<\/p><p> } <\/p><p>} <\/p><p>int main() { <\/p><p><span>\u00a0\u00a0 \u00a0<\/span>int n; <\/p><p><span>\u00a0\u00a0 \u00a0<\/span>cin &gt;&gt; n; <\/p><p><span>\u00a0\u00a0 \u00a0<\/span>vector arr(n); <\/p><p><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 <\/span>for (int i = 0; i &lt; n; ++i) { <\/p><p><span>\u00a0\u00a0 \u00a0<\/span><span>\u00a0\u00a0 \u00a0<\/span>arr[i] = i + 1;<\/p><p> } <\/p><p>generatePermutations(arr, 0); <\/p><p>cout &lt;&lt; \"This is O(n!) - Factorial Complexity\"; <\/p><p>return 0; <\/p><p>}<\/p><\/algorithm><\/div><\/vector><\/iostream><\/code><\/pre>\n<\/div>\n<\/div>\n<p>For <b>n<\/b> elements, there are:\u00a0<\/p>\n<p><b>n! = n \u00d7 (n-1) \u00d7 (n-2) \u00d7 &#8230; \u00d7 1\u00a0<\/b><\/p>\n<p>permutations.<\/p>\n<p>So the algorithm has <b>O(n!)<\/b> time complexity (ignoring the additional <b>O(n)<\/b> work needed to print each permutation).<\/p>\n<\/div>\n<\/div>\n\n","protected":false},"excerpt":{"rendered":"<p>Big O notation describes how an algorithm\u2019s running time or space usage grows as the input size \ud835\udc5b n increases.\u00a0 In C++, you can see common Big O classes like \ud835\udc42(1), \ud835\udc42(log \ud835\udc5b), \ud835\udc42(\ud835\udc5b), \ud835\udc42(\ud835\udc5b log \ud835\udc5b), and \ud835\udc42(\ud835\udc5b2) in simple code patterns and STL operations.\u00a0 Common Big O classes with C++ examples \ud835\udc42(1) \u2013 [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":7081775,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[12035],"tags":[1022,239149,11560,211407,211404,211406,211408],"dealstore":[],"offerexpiration":[],"class_list":["post-7081774","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-animation","tag-big","tag-big-o-examples-in-c","tag-examples","tag-free-download-plus-ui","tag-opengl-projects","tag-plus-ui-blogger-templates","tag-plus-ui-github"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v26.4 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Big O Examples in C++ - Som2ny Network<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Big O Examples in C++ - Som2ny Network\" \/>\n<meta property=\"og:description\" content=\"Big O notation describes how an algorithm\u2019s running time or space usage grows as the input size \ud835\udc5b n increases.\u00a0 In C++, you can see common Big O classes like \ud835\udc42(1), \ud835\udc42(log \ud835\udc5b), \ud835\udc42(\ud835\udc5b), \ud835\udc42(\ud835\udc5b log \ud835\udc5b), and \ud835\udc42(\ud835\udc5b2) in simple code patterns and STL operations.\u00a0 Common Big O classes with C++ examples \ud835\udc42(1) \u2013 [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774\" \/>\n<meta property=\"og:site_name\" content=\"Som2ny Network\" \/>\n<meta property=\"article:published_time\" content=\"2026-11-15T11:57:04+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/accountants4yourbusiness.co.uk\/wp-content\/uploads\/2026\/11\/AEn0k_sH1Xtw77_bXfWAz2stm7twNU_S9ZgPxzk8snVHTBjm7p5D3jiygoLRc4Eo4Soil9-4P6CogiEh_E1cbLL2PqmkEGAC1R3c.gif\" \/>\n\t<meta property=\"og:image:width\" content=\"800\" \/>\n\t<meta property=\"og:image:height\" content=\"720\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/gif\" \/>\n<meta name=\"author\" content=\"admin\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"admin\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"6 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#article\",\"isPartOf\":{\"@id\":\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774\"},\"author\":{\"name\":\"admin\",\"@id\":\"https:\/\/peraltafinancing.com\/#\/schema\/person\/b8eaddeb20a8727558e0d0cddcca426e\"},\"headline\":\"Big O Examples in C++\",\"datePublished\":\"2026-11-15T11:57:04+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774\"},\"wordCount\":611,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/peraltafinancing.com\/#organization\"},\"image\":{\"@id\":\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#primaryimage\"},\"thumbnailUrl\":\"https:\/\/accountants4yourbusiness.co.uk\/wp-content\/uploads\/2026\/11\/AEn0k_sH1Xtw77_bXfWAz2stm7twNU_S9ZgPxzk8snVHTBjm7p5D3jiygoLRc4Eo4Soil9-4P6CogiEh_E1cbLL2PqmkEGAC1R3c.gif\",\"keywords\":[\"Big\",\"Big O Examples in C++\",\"Examples\",\"Free download Plus Ui\",\"OpenGL Projects\",\"Plus ui blogger templates\",\"Plus UI GitHub\"],\"articleSection\":[\"Animation\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774\",\"url\":\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774\",\"name\":\"Big O Examples in C++ - Som2ny Network\",\"isPartOf\":{\"@id\":\"https:\/\/peraltafinancing.com\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#primaryimage\"},\"image\":{\"@id\":\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#primaryimage\"},\"thumbnailUrl\":\"https:\/\/accountants4yourbusiness.co.uk\/wp-content\/uploads\/2026\/11\/AEn0k_sH1Xtw77_bXfWAz2stm7twNU_S9ZgPxzk8snVHTBjm7p5D3jiygoLRc4Eo4Soil9-4P6CogiEh_E1cbLL2PqmkEGAC1R3c.gif\",\"datePublished\":\"2026-11-15T11:57:04+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#primaryimage\",\"url\":\"https:\/\/accountants4yourbusiness.co.uk\/wp-content\/uploads\/2026\/11\/AEn0k_sH1Xtw77_bXfWAz2stm7twNU_S9ZgPxzk8snVHTBjm7p5D3jiygoLRc4Eo4Soil9-4P6CogiEh_E1cbLL2PqmkEGAC1R3c.gif\",\"contentUrl\":\"https:\/\/accountants4yourbusiness.co.uk\/wp-content\/uploads\/2026\/11\/AEn0k_sH1Xtw77_bXfWAz2stm7twNU_S9ZgPxzk8snVHTBjm7p5D3jiygoLRc4Eo4Soil9-4P6CogiEh_E1cbLL2PqmkEGAC1R3c.gif\",\"width\":800,\"height\":720},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/peraltafinancing.com\/?bp_activities=1\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Big O Examples in C++\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/peraltafinancing.com\/#website\",\"url\":\"https:\/\/peraltafinancing.com\/\",\"name\":\"Som2ny Network\",\"description\":\"Daily Deals\",\"publisher\":{\"@id\":\"https:\/\/peraltafinancing.com\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/peraltafinancing.com\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\/\/peraltafinancing.com\/#organization\",\"name\":\"Som2ny Network\",\"url\":\"https:\/\/peraltafinancing.com\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/peraltafinancing.com\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/accountants4yourbusiness.co.uk\/wp-content\/uploads\/2026\/07\/4a0953c4-logo-300x86-1.png\",\"contentUrl\":\"https:\/\/accountants4yourbusiness.co.uk\/wp-content\/uploads\/2026\/07\/4a0953c4-logo-300x86-1.png\",\"width\":300,\"height\":86,\"caption\":\"Som2ny Network\"},\"image\":{\"@id\":\"https:\/\/peraltafinancing.com\/#\/schema\/logo\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/peraltafinancing.com\/#\/schema\/person\/b8eaddeb20a8727558e0d0cddcca426e\",\"name\":\"admin\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/peraltafinancing.com\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/729ae85bf62b9917e93538db2f2688ca?s=96&r=g&default=https%3A%2F%2Faccountants4yourbusiness.co.uk%2Fwp-content%2Fplugins%2Fbuddypress-first-letter-avatar%2Fimages%2Fdefault%2F96%2Flatin_a.png\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/729ae85bf62b9917e93538db2f2688ca?s=96&r=g&default=https%3A%2F%2Faccountants4yourbusiness.co.uk%2Fwp-content%2Fplugins%2Fbuddypress-first-letter-avatar%2Fimages%2Fdefault%2F96%2Flatin_a.png\",\"caption\":\"admin\"},\"sameAs\":[\"https:\/\/accountants4yourbusiness.co.uk\"],\"url\":\"https:\/\/accountants4yourbusiness.co.uk\/?author=1\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Big O Examples in C++ - Som2ny Network","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774","og_locale":"en_US","og_type":"article","og_title":"Big O Examples in C++ - Som2ny Network","og_description":"Big O notation describes how an algorithm\u2019s running time or space usage grows as the input size \ud835\udc5b n increases.\u00a0 In C++, you can see common Big O classes like \ud835\udc42(1), \ud835\udc42(log \ud835\udc5b), \ud835\udc42(\ud835\udc5b), \ud835\udc42(\ud835\udc5b log \ud835\udc5b), and \ud835\udc42(\ud835\udc5b2) in simple code patterns and STL operations.\u00a0 Common Big O classes with C++ examples \ud835\udc42(1) \u2013 [&hellip;]","og_url":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774","og_site_name":"Som2ny Network","article_published_time":"2026-11-15T11:57:04+00:00","og_image":[{"width":800,"height":720,"url":"https:\/\/accountants4yourbusiness.co.uk\/wp-content\/uploads\/2026\/11\/AEn0k_sH1Xtw77_bXfWAz2stm7twNU_S9ZgPxzk8snVHTBjm7p5D3jiygoLRc4Eo4Soil9-4P6CogiEh_E1cbLL2PqmkEGAC1R3c.gif","type":"image\/gif"}],"author":"admin","twitter_card":"summary_large_image","twitter_misc":{"Written by":"admin","Est. reading time":"6 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#article","isPartOf":{"@id":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774"},"author":{"name":"admin","@id":"https:\/\/peraltafinancing.com\/#\/schema\/person\/b8eaddeb20a8727558e0d0cddcca426e"},"headline":"Big O Examples in C++","datePublished":"2026-11-15T11:57:04+00:00","mainEntityOfPage":{"@id":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774"},"wordCount":611,"commentCount":0,"publisher":{"@id":"https:\/\/peraltafinancing.com\/#organization"},"image":{"@id":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#primaryimage"},"thumbnailUrl":"https:\/\/accountants4yourbusiness.co.uk\/wp-content\/uploads\/2026\/11\/AEn0k_sH1Xtw77_bXfWAz2stm7twNU_S9ZgPxzk8snVHTBjm7p5D3jiygoLRc4Eo4Soil9-4P6CogiEh_E1cbLL2PqmkEGAC1R3c.gif","keywords":["Big","Big O Examples in C++","Examples","Free download Plus Ui","OpenGL Projects","Plus ui blogger templates","Plus UI GitHub"],"articleSection":["Animation"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#respond"]}]},{"@type":"WebPage","@id":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774","url":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774","name":"Big O Examples in C++ - Som2ny Network","isPartOf":{"@id":"https:\/\/peraltafinancing.com\/#website"},"primaryImageOfPage":{"@id":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#primaryimage"},"image":{"@id":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#primaryimage"},"thumbnailUrl":"https:\/\/accountants4yourbusiness.co.uk\/wp-content\/uploads\/2026\/11\/AEn0k_sH1Xtw77_bXfWAz2stm7twNU_S9ZgPxzk8snVHTBjm7p5D3jiygoLRc4Eo4Soil9-4P6CogiEh_E1cbLL2PqmkEGAC1R3c.gif","datePublished":"2026-11-15T11:57:04+00:00","breadcrumb":{"@id":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/accountants4yourbusiness.co.uk\/?p=7081774"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#primaryimage","url":"https:\/\/accountants4yourbusiness.co.uk\/wp-content\/uploads\/2026\/11\/AEn0k_sH1Xtw77_bXfWAz2stm7twNU_S9ZgPxzk8snVHTBjm7p5D3jiygoLRc4Eo4Soil9-4P6CogiEh_E1cbLL2PqmkEGAC1R3c.gif","contentUrl":"https:\/\/accountants4yourbusiness.co.uk\/wp-content\/uploads\/2026\/11\/AEn0k_sH1Xtw77_bXfWAz2stm7twNU_S9ZgPxzk8snVHTBjm7p5D3jiygoLRc4Eo4Soil9-4P6CogiEh_E1cbLL2PqmkEGAC1R3c.gif","width":800,"height":720},{"@type":"BreadcrumbList","@id":"https:\/\/accountants4yourbusiness.co.uk\/?p=7081774#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/peraltafinancing.com\/?bp_activities=1"},{"@type":"ListItem","position":2,"name":"Big O Examples in C++"}]},{"@type":"WebSite","@id":"https:\/\/peraltafinancing.com\/#website","url":"https:\/\/peraltafinancing.com\/","name":"Som2ny Network","description":"Daily Deals","publisher":{"@id":"https:\/\/peraltafinancing.com\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/peraltafinancing.com\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/peraltafinancing.com\/#organization","name":"Som2ny Network","url":"https:\/\/peraltafinancing.com\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/peraltafinancing.com\/#\/schema\/logo\/image\/","url":"https:\/\/accountants4yourbusiness.co.uk\/wp-content\/uploads\/2026\/07\/4a0953c4-logo-300x86-1.png","contentUrl":"https:\/\/accountants4yourbusiness.co.uk\/wp-content\/uploads\/2026\/07\/4a0953c4-logo-300x86-1.png","width":300,"height":86,"caption":"Som2ny Network"},"image":{"@id":"https:\/\/peraltafinancing.com\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/peraltafinancing.com\/#\/schema\/person\/b8eaddeb20a8727558e0d0cddcca426e","name":"admin","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/peraltafinancing.com\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/729ae85bf62b9917e93538db2f2688ca?s=96&r=g&default=https%3A%2F%2Faccountants4yourbusiness.co.uk%2Fwp-content%2Fplugins%2Fbuddypress-first-letter-avatar%2Fimages%2Fdefault%2F96%2Flatin_a.png","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/729ae85bf62b9917e93538db2f2688ca?s=96&r=g&default=https%3A%2F%2Faccountants4yourbusiness.co.uk%2Fwp-content%2Fplugins%2Fbuddypress-first-letter-avatar%2Fimages%2Fdefault%2F96%2Flatin_a.png","caption":"admin"},"sameAs":["https:\/\/accountants4yourbusiness.co.uk"],"url":"https:\/\/accountants4yourbusiness.co.uk\/?author=1"}]}},"_links":{"self":[{"href":"https:\/\/accountants4yourbusiness.co.uk\/index.php?rest_route=\/wp\/v2\/posts\/7081774","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/accountants4yourbusiness.co.uk\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/accountants4yourbusiness.co.uk\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/accountants4yourbusiness.co.uk\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/accountants4yourbusiness.co.uk\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=7081774"}],"version-history":[{"count":0,"href":"https:\/\/accountants4yourbusiness.co.uk\/index.php?rest_route=\/wp\/v2\/posts\/7081774\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/accountants4yourbusiness.co.uk\/index.php?rest_route=\/wp\/v2\/media\/7081775"}],"wp:attachment":[{"href":"https:\/\/accountants4yourbusiness.co.uk\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=7081774"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/accountants4yourbusiness.co.uk\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=7081774"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/accountants4yourbusiness.co.uk\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=7081774"},{"taxonomy":"dealstore","embeddable":true,"href":"https:\/\/accountants4yourbusiness.co.uk\/index.php?rest_route=%2Fwp%2Fv2%2Fdealstore&post=7081774"},{"taxonomy":"offerexpiration","embeddable":true,"href":"https:\/\/accountants4yourbusiness.co.uk\/index.php?rest_route=%2Fwp%2Fv2%2Fofferexpiration&post=7081774"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}