firstpos2

var arr1 = [50,20,2,1,3,5];

var arr = [50,20,2,1,3,5];

// console.log(arr.sort()[0]);               // min
// console.log(arr.sort()[arr.length -1]);     //max


var min = arr1.sort()[0];
var max = arr1.sort()[arr.length -1];

console.log(arr)
// console.log(min,max);

var currMin = min;
var currMax = max;


console.log(currMin,currMax);


//////// ALGORITMO

if (min > 1) {
    console.log(1,"fine");
    return;
}

console.log(min,max);

var searched = min + 1;


for (var i = 0; i < arr.length; i++) {
    if (arr[i] > 0 ) {

        console.log(currMin, currMax,searched);
        if (arr[i] > searched) {

            if (arr[i] < currMin) {
                currMin = arr[i];
            }

            else if (arr[i] < currMax) {
                currMax = arr[i];
            }


        }

        else if (arr[i] == searched) {
            currMin = searched;
            searched++;
        }

        else {

            if (arr[i] < currMax && arr[i] > searched) {
                currMax = arr[i];
            }
        }


    }
}


if (searched == currMax) {
    console.log(currMax+1, "through max");
}
else {
    console.log(searched, "through searched");
}