Merge Sort is based on divide & conquer approach, first we divide array into two parts until we got single element then merge the single single element and create a subarray, Now merge two sorted subarray into single array likewise in final we got the final sorted array. In Conquer approach we have i, j […]
[Question]: Prepare recursion stack for multilevel recursion.
Draw Recursion Stack Read More »
# Approach Assume two part of the array sorted & unsorted. Sorted start from 1 element A[0] & fills with unsorted one by one (A[1] to A[n-1]) Attached code with dry run. In Insertion sort we sort using two sets. One is Sorted set Another is unsorted one. Initially we sorted is index 0 element
Step 1: Find minimum element in array & swap with beginning element Step 2: So now swap min elements from inner loop in the array. So we have taken `minIndex` which assigned from 0th element i array till last & compare it with i+1 element
[Question]: In given array find difference between lowest & highest occurrence elements . For Example: Array : [5,4,5,5,6,9,5,6] O/P = 2. because 5 appears 4 times & element 6 is 2 times. difference is 2.
How to Find the difference between highest & lowest occurring elements in an array ? Read More »
[Question]: Count frequency of each element in a given array .For example: Given Array [5,4,5,5,6,9,5,6]. Output is [4: 1, 6: 2, 9: 1, 5: 4] Which indicates 4 is 1 time, 6 is 2 times and so on…#Approach 1: – Use HashMap /Dictionary . Because dictionary key are unique so we can use of that
Count frequency of each element in an array Read More »
[Question]: Check if given number is prime ? Prime numbers are divisible by self & 1 onlyExample prime number : 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59 #Approach 1: if the number is perfectly divisible by 2,3,5 Then it’s not prime. Approach #2: Take a
How to check if number is prime ? Read More »
[Question] Print all divisors of a given number For example divisors of 36 are = 1,2,3,4,5,9,12,18,36#Approach: We can find square root of a given number & check if its perfectly divisible sqrt numbers
How to print all divisors of a number Read More »
[Question]: Check if given number is Armstrong. for example : 371 = 3 pow 3 + 7 pow 3 + 1 pow 3 = 371 The count of digits to power of each digits & sum is equivalent to self number. (pow id power )
How to check if the given number is Armstrong ? Read More »
