The most important things in my life is gaining knowledge and traveling. I am self learning person. Hope to share my experience and help some people in webdev.
Well, it depends on which algorithm you would chose. You can find the card with O(n) but you also can solve the same problem with the O(log2(n)) complexity.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
So Pawel what is the result of big O notation, if looking for the library card of Adam Smith? :D
Well, it depends on which algorithm you would chose. You can find the card with O(n) but you also can solve the same problem with the O(log2(n)) complexity.