Invalid claims : Algorithm is not O(n) when we use SORT!

programming
Tags: #<Tag:0x00007f242761ede0>

#1

I have just started using this platform and I find lots of false comments in discussions claiming solutions to be O(n) time complexity even when they use sort in the solution. I wanted this to go out there as a feedback. :slight_smile: