Solution: Count Element Occurrence
Here is a detailed analysis of the different ways to count the frequency of a number in a sorted array of integers.
Solution #1: Brute force with linear search
Press + to interact
class Count {public static int calcFreq(int arr[], int key) {int count = 0;//traversing the arrayfor (int i = 0; i < arr.length; i++) {//checking if current index value matches keyif (arr[i] == key)//incrementing count if it doescount++;}return count;}public static void main(String args[]) {int arr[] = {-5,-3,0,1,3,3,3,3,4,5};int key = 3;System.out.println("The key \"" + key + "\" occurs " + calcFreq(arr, key) + " times in the Array.");}}
This is an extremely simple way to solve this problem. We simply initialize a variable, count
, to keep count and set it to 0 (line 3). We then iterate over the array (line 5), increasing count
by one every time the key
(value to search) is encountered (lines 7-9).
Time complexity
The time complexity of this algorithm is in ...
Access this course and 1400+ top-rated courses and projects.