JSFiddle - React, Tailwind, and code Playground

by Jeff Santos

HTML

Enter Array Size:
<input type="textbox" id="enterArraySize" value="" />
<input type="button" value="Create Array" onclick="createArray();" />
<br/> Index:
<input type="textbox" id="indexx" value="" />
<br/> Value:
<input type="textbox" id="valuee" value="" />
<input type="button" value="Insert Into Array" onclick="arrayInsert();" />
<br/> Enter Value to Find:
<input type="textbox" id="enterValue" />
<input type="button" value="Search Array" / on click="searchArray();" />
<div id="outcome">
</div>




</div>

JavaScript

var size = 100;
var array = new Array(size);
var count = 0;

function createArray() {
  for (var i = 0; i < array.length; i++) {
    var min = 1;
    var max = 100;
    array[i] = Math.floor(Math.random() * (max - min + 1)) + min

  }
  out = "";
  for (var i = 0; i < size; i++) {
    out += i + " : " + array[i] + "<br/>";
  }
  document.getElementById("outcome").innerHTML = out;
}

function searchArray() {
  clearDisplay();

  var  = parseInt(document.getElementById("enterValue").value);
  var oCount = 0;

  if ((v < 1) || (v > 100)) {
    d += "Input out of bounds. Use a number between 1 and 100. <br/>";
    document.getElementById("output").innerHTML = d;
    displayArray();
  }
  for (i = 0; i < array.length - 1; i++) {
    oCount++;
    if (x == array[i]) {
      d += "Value " + x + " found at position " + array[i] + ". " + oCount +
        " comparison(s) performed. <br/>" +
        "Time complexity for this algorithm is O(n). <br/>";
      document.getElementById("outcome").innerHTML = d;
      displayArray();
    } else {
      d += "Number not found. <br/>";
      document.getElementById("outcome").innerHTML = d;
      displayArray();
      break;
    }
  }


}