Question

Can someone tell me about Big O notation with brief definition ?

Answer 1

Big O notation is the language we use for articulating how long an algorithm takes to run. It's how we compare the efficiency of different approaches to a problem. With big O notation we express the runtime in terms of—brace yourself—how quickly it grows relative to the input, as the input gets arbitrarily large.

Source: https://www.interviewcake.com/article/java/big-o-notation-time-and-space-complexity

Hope this helps you!
if it did, please give me a medal, and close your question.

Answer 2

Please close this question @Skybrel so other people can get there questions higher.