-
Notifications
You must be signed in to change notification settings - Fork 858
/
MinimumAbsoluteDifferenceInAnArray.java
69 lines (61 loc) · 1.36 KB
/
MinimumAbsoluteDifferenceInAnArray.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
/**
*
* Problem Statement-
* [Minimum Absolute Difference in an Array](https://www.hackerrank.com/challenges/minimum-absolute-difference-in-an-array)
*
*/
package com.javaaid.hackerrank.solutions.algorithms.sorting;
import java.util.Scanner;
/**
* @author Kanahaiya Gupta
*
*/
public class MinimumAbsoluteDifferenceInAnArray {
public static void sort(int a[], int lo, int hi) {
if (hi > lo) {
int q = partition(a, lo, hi);
sort(a, lo, q - 1);
sort(a, q + 1, hi);
}
}
public static int partition(int[] a, int lo, int hi) {
int i = lo;
int j = hi + 1;
while (hi > lo) {
while (a[++i] < a[lo])
if (i == hi)
break;
while (a[--j] > a[lo])
if (j == lo)
break;
if (i >= j)
break;
swap(a, i, j);
}
swap(a, lo, j);
return j;
}
public static void swap(int a[], int i, int j) {
int temp = a[i];
a[i] = a[j];
a[j] = temp;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] a = new int[n];
for (int a_i = 0; a_i < n; a_i++) {
a[a_i] = in.nextInt();
}
sort(a, 0, a.length - 1);
int min = Integer.MAX_VALUE;
for (int i = 1; i < a.length; i++) {
int diff = a[i] - a[i - 1];
if (diff < min) {
min = diff;
}
}
System.out.println(min);
in.close();
}
}