Brute force method - check one by one
Q1. Given an integer N, write a program to count the number of digits in N.
Time complexity - O(log10(n))
hint:- because its loops run only nuber of digits, all division method time is in log.
Brute force method - check one by one
Q1. Given an integer N, write a program to count the number of digits in N.
Time complexity - O(log10(n))
1 Comments
hi
ReplyDelete