Find the minimum distance between two numbers

Given an unsorted array arr[] and two numbers x and y, find the minimum distance between x and y in arr[]. The array might also contain duplicates. You may assume that both x and y are different and present in arr[].

Examples: 

Input: arr[] = {1, 2}, x = 1, y = 2
Output: Minimum distance between 1 
and 2 is 1.
Explanation: 1 is at index 0 and 2 is at 
index 1, so the distance is 1

Input: arr[] = {3, 4, 5}, x = 3, y = 5
Output: Minimum distance between 3 
and 5 is 2.
Explanation:3 is at index 0 and 5 is at 
index 2, so the distance is 2

Input: 
arr[] = {3, 5, 4, 2, 6, 5, 6, 6, 5, 4, 8, 3},  
x = 3, y = 6
Output: Minimum distance between 3 
and 6 is 4.
Explanation:3 is at index 0 and 6 is at 
index 5, so the distance is 4

Input: arr[] = {2, 5, 3, 5, 4, 4, 2, 3}, 
x = 3, y = 2
Output: Minimum distance between 3 
and 2 is 1.
Explanation:3 is at index 7 and 2 is at 
index 6, so the distance is 1

Method 1: 

• Approach: The task is to find the distance between two given numbers, So find the distance between any two elements using nested loops. The outer loop for selecting the first element (x) and the inner loop for traversing the array in search for the other element (y) and taking the minimum distance between them.
• Algorithm: 
  1. Create a variable m = INT_MAX
  2. Run a nested loop, the outer loop runs from start to end (loop counter i), the inner loop runs from i+1 to end (loop counter j).
  3. If the ith element is x and jth element is y or vice versa, update m as m = min(m,j-i)
  4. Print the value of m as minimum distance
• Implementation:

Minimum distance between 3 and 6 is 4

• Complexity Analysis: 
  • Time Complexity: O(n^2), Nested loop is used to traverse the array.
  • Space Complexity: O(1), no extra space is required.

Method 2: 

• Approach: So the basic approach is to check only consecutive pairs of x and y. For every element x or y, check the index of the previous occurrence of x or y and if the previous occurring element is not similar to current element update the minimum distance. But a question arises what if an x is preceded by another x and that is preceded by a y, then how to get the minimum distance between pairs. By analyzing closely it can be seen that every x followed by a y or vice versa can only be the closest pair (minimum distance) so ignore all other pairs.
• Algorithm: 
  1. Create a variable prev=-1 and m= INT_MAX
  2. Traverse through the array from start to end.
  3. If the current element is x or y, prev is not equal to -1 and array[prev] is not equal to current element then update m = max(current_index – prev, m), i.e. find the distance between consecutive pairs and update m with it.
  4. print the value of m
• Thanks to wgpshashank for suggesting this approach.

• Implementation.

Minimum distance between 3 and 6 is 1

• Complexity Analysis:
• Time Complexity: O(n). 
  Only one traversal of the array is needed.
• Space Complexity: O(1). 
  As no extra space is required.
   

Please write comments if you find the above codes/algorithms incorrect, or find other ways to solve the same problem.