Big O Notation explained

Introduction Big O notation measures how fast your code runs as the number of inputs grows. It’s really important to understand the following algorithms and try to apply the most performatic ones in your solutions. I will order them from fastest to slowest: O(1) — Constant Time When using O(1), it doesn’t matter the size of your input, the code will always take the same time to run. var users = new Dictionary int , string > { { 1 , "Caique" }, { 2 , "Maria" }, { 3 , "Fernanda" }, }; var user = u