COP3530 Assignment 2

by joseph_kanawall2400

HTML

The algorithm is O(n)<br/><br/>

Index:<input type="input" id="index" value="2"/> (using 0 count indexing)<br/>
Number:<input type="input" id="number" value="60"/><br/>
<input type="button" value="Insert Into Array" onClick="NewInsertion(array, parseInt(getElementById('index').value), parseInt(getElementById('number').value));" />
<br/><br/>
(index ~ number)<br/>
OC = O Count<br/>
<div id="log" style="column-count:1;column-rule:2px solid black;"></div>

JavaScript

var count = 0;
var array = new Array(1000);
var log = document.getElementById("log");

for (x = 0; x < array.length; x++) {
	array[x] = Math.floor(Math.random() * 100) + 1;
}

function InsertIntoArray(array, index, number) {
	count = 0;
	for(var x = array.length - 1; x >= index; x--) {
		if(x == index) {
			array[x] = number;count++;
		}
		else {
			array[x] = array[x-1];count++;
		}
	}
}

function PrintArray(array) {
	var str = "";
	for(var x = 0; x < 1000; x++) {
		str += x + " ~ " + array[x] + "<br/>";
	}
	return str;
}

function NewInsertion(array, index, number) {
	InsertIntoArray(array, index, number);
	log.innerHTML += "OC: " + count + "<br/>Index: " + index + "<br/>Value: " + number + "<br/>Array:<br/>" + PrintArray(array);
	log.style.columnCount++;
}


log.innerHTML += "<br/><br/><br/>Array:<br/>" + PrintArray(array);