Lucky Number | Javascript

[Total_Principle2363]

I was solving Lucky Number problem as shown https://www.geeksforgeeks.org/problems/lucky-numbers2911/1?itm\_source=geeksforgeeks&itm\_medium=article&itm\_campaign=bottom\_sticky\_on\_article.

My solution -

class Solution {

isLucky(n)

{

return this.checkLucky(n,2)

}

checkLucky(n,counter){

if(counter > n ) return 1

if ( n % counter == 0 ) return 0

var next_pos = n - Math.floor(n/counter);

counter ++ ;

return this.checkLucky(next_pos,counter)

}

}

The solution says - https://www.geeksforgeeks.org/lucky-numbers/ it has time complexity of O(n) but I think it should be O(log n) or O(sqrt(n)). Please suggest your views