Given an unsorted array of nums containing n distinct numbers in the range [0, n], one is missed. Return the only number in the range that is missing from the array. O(N^2(Logn))

Get-Missing-Number.js

// Given an unsorted array of nums containing n distinct numbers in the range [0, n], one is missed.
// Return the only number in the range that is missing from the array.

// O(N^2(Logn))
const getMissingNumber = function (arr, n) {
	arr.sort(a, b) => {
		if(a <= b) {
			return -1;
		}
		else {
			return 1
		}
	};

	for(let i = 0; i < arr.lenght; i++) {
		if(i !== arr[i]) {
			return i;
		}
	}
}