#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int l,a;
double maks = 0;
cin >> n >> l;
int arr[n];
for (int i=0; i<n; i++) {
cin >> arr[i];
}
sort(arr, arr+n);
for (int i=0; i < n-1; i++) {
a = arr[i+1]-arr[i];
if (a > maks) {
maks = a;
}
}
maks = maks/2;
if (arr[0] > maks) {
maks = arr[0];
}
if (l-arr[n-1] > maks) {
maks = l-arr[n-1];
}
cout << maks;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuOwoJaW50IGwsYTsKCWRvdWJsZSBtYWtzID0gMDsKCWNpbiA+PiBuID4+IGw7CglpbnQgYXJyW25dOwoJZm9yIChpbnQgaT0wOyBpPG47IGkrKykgewoJCWNpbiA+PiBhcnJbaV07Cgl9Cglzb3J0KGFyciwgYXJyK24pOwoJCglmb3IgKGludCBpPTA7IGkgPCBuLTE7IGkrKykgewoJCWEgPSBhcnJbaSsxXS1hcnJbaV07CgkJaWYgKGEgPiBtYWtzKSB7CgkJCW1ha3MgPSBhOwoJCX0KCX0KCQoJbWFrcyA9IG1ha3MvMjsKCWlmIChhcnJbMF0gPiBtYWtzKSB7CgkJbWFrcyA9IGFyclswXTsKCX0KCWlmIChsLWFycltuLTFdID4gbWFrcykgewoJCW1ha3MgPSBsLWFycltuLTFdOwoJfQoJCgljb3V0IDw8IG1ha3M7CgkKCXJldHVybiAwOwp9