Count number of occurrences of a number
Given a sorted array arr[] and a number x, write a function that counts the occurrences of x in arr[]. Expected time complexity is O(Logn)
Examples:
Input: arr[] = {1, 1, 2, 2, 2, 2, 3,}, x = 2
Output: 4
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
we can apply a variant of binary search
ReplyDeletewe can find d first and last occurence of the element in the array
no. of occurencec= last-first+1
@Navin yes you can solve in the way you mentioned ...this will be o(logn) solution..
ReplyDelete