What is the time complexity Big-O of this algorithm?\n\n, The first assumption it\'s O(N * lg N) but it is not correct, why?\n\n```\n        count = 0\n        for i = N : 1 {\n            for j = 0 : i {\n                count = count + 1\n                j =  j + 1\n            }\n            i = i/2\n        }\n        print(count)\n```

What is the time complexity Big-O of this algorithm?\n\n, The first assumption it\'s O(N * lg N) but it is not correct, why?\n\n\n        count = 0\n        for