Anusree Anilkumaranusree-anilkumar.hashnode.dev·Dec 20, 2022Big O in Data Structures and AlgorithmO(1) - constant (does not contain loops) O(log n) - searching operations O(n) - Linear, loops (for, while) O(n*log(n)) - Sorting operations O(n^2) - two nested loops O(2^n) - recursive algorithm O(n!) - Adding a loop for every element Rules: ...42 readsdata structuresAdd a thoughtful commentNo comments yetBe the first to start the conversation.