Assignment 2: "Time Complexity"

by MimiE

JavaScript

var array = new Array();
var display = "";
var count = "";

function clearDisplay() {
	display = "";
}

function fillArray() {
	clearDisplay();
	for (var i = 0; i < 1000; i++) {
  
		array[i] = Math.floor(Math.random() * 100 + 1);
	}
	displayArray();
}

function userArray() {
	clearDisplay();
  array = [];
  var z = document.getElementById('size').value;
  
  if(isNaN(z) || z == null || z == "") {
  	alert("Please enter a numerical value to populate an array.");
    return;
  }
	for (var i = 0; i < z; i++) {
		array[i] = Math.floor(Math.random() * 100 + 1);
	}
	displayArray();
}

function displayArray() {
	for (var i = 0; i < array.length; i++) {
  	display += "Array index #" + i + ": " + array[i] + "<br/>"
  }
  document.getElementById("output").innerHTML = display;
}

function insertIntoArray() {
	clearDisplay();
	var count = 0;
	var l = document.getElementById('location').value;
	var n = document.getElementById('number').value;
  document.getElementById("output").innerHTML = display;

  if(isNaN(l) || isNaN(n) || l == null || n == null || l == "" || n == "") {
  	alert("Please enter a numerical value for both location and value.");
    return;
  }
 	if(l < array.length) {
    for(var i = array.length-1; i >= l; i--) {
 			count++;
      array[i] = array[i-1];
 		}
 		array[l] = n;
    display += "Inserted the number " + n + " at location " + l + "." + "<br/>" + "<br/>" + " The number of operations performed was " + count + "." + "<br/>";
  }
  else if(l == array.length) {
  	count = 1;
    array[l-1] = n;
    display += "Inserted the number " + n + " at location " + l + "." + "<br/>"  + "<br/>" + " The number of operations performed was " + count + "." + "<br/>";
  }
  else {
  	alert("Please choose an index location which is less than or equal to the size of the array.");
  }
 displayArray();
}

function searchArray() {
	var count = 0;
	var s = document.getElementById('search').value;
  
  if(isNaN(s) || s == null || s == "") {
  	alert("Please enter a...