Question

Can someone please help, third time I'm asking. I need a basic javascript with no push or splice command. Please don't post a picture of the code,because my vision is poor and I won't be able to see it. Also, I need breakdown of what's in HTMLand what' s in javascript. All requirements are below. Thanks for your help.

This is a 2 part assignment, but both parts can be completed in one program. Also, please follow ALL Required Programming parameters

Part 1 - Using your JSFiddle account and JavaScript you will create a program that will instantiate an integer array of size 1000. Fill each array element with a random integer between 1 and 100.

There is one function called insertIntoArray.

There are 3 arguments: argument 1 is the array; argument 2 is the index of where you are going to insert a new number; argument 3 is the number to insert.

The program should insert the new number at the index given and shift all the previous entries index up by 1. Since the array is capped at 1000, the highest element of the array will be deleted. Count the number of operations performed on the array and output this to the screen. An operation is if you assign a value or compare a value - only compare or assign operations should be counted.

Change the array size to 100 and insert into a different index in the array. State using Big O Notation your time complexity.

Required Programming parameters:

1. Your Big-O notation and justification will be written in the html section of JSFiddle.

2. Create the array in Javascript: var array = new Array(1000);

3. Create a loop to assign each array element a random value.

4. DO NOT use push or splice commands - assign elements by using = (in code)

5. When inserting you will be pushing the last value off the end of the array (everything shifts right)

6. Use a global counter to count every time you make an assignment (use an = or == operator)

Part 2 - Using your JSFiddle account and Javascript you will create a program that will instantiate an integer array of size 1000. Fill each array element with a random integer between 1 and 100. Do NOT sort the array..

There will be one function called searchArray. There will be 2 arguments: argument 1 is the array; argument 2 is the value you are searching for within the array. Each time the program compares 2 numbers you must count it as an operation (only count comparisons). Output the total number of operations. State using Big O Notation your time complexity and be prepared to justify your answer. This should be output in your actual JSFiddle

Answer 1

Answer: PART 1: Htiml Code: <div id="operations!"></div><br> <div id="operation s 2 "></div><br> <div id="find"></div><br> id=" find-option"></div><br> <div <div id="form-array"> <form> Index: <br> <input type="text" name = " index" Id="index value " value = " 3 " >< br> Number:<br> Kinput type-"text" name-"number" id- "number" value-"0" <br<br> </form> <input type='' submit" id="click" value-"Update Array "><br><br> </div> <div id="updated-array"></div>

JAVASCRIPT CODE var arraynew Array (1000) document.getElementBYId( "click").onclick = {my FormSubmit () ; function() function myFormSubmit) //o (1) var index entered document.getElementById("index value"). value; var number entered = document.getEleme ntById("number").value; document.getElementById (' updated-array) .innerHTML InsertIntoArray (array, index entered, number entered) 1/o(l) function InsertIntoArray (array, index, number) //o (1) //do 100) 1) for (vara-0; a<array.length ; a++){ // О(N) multiple times //array] ai array[a]-Math.floor ( (Math.random) o(1) //accept user input as number array lindex]number; // o(1) //printing output var updated array ""i for (1 = 0; 1 < array.length; 1++) { // 0(N) updated array += array[1] + " -value of array index " + i + "br>" / Q1) //1000

return document.getElementById ('updated-array) .innerHTMT updated array 1/ 0 (1) // Count the number of operations performed on the array and output this to the screen document.getElementById ('operations1').innerHTML "Number of Operations: 7018"; // Time Complexity using Big o Notation document getElementById ('operations2").innerHTML"Big o Notation Time Complexity: o(1) O(1) (1) o (1) 0 (1) o (1) 0 (1) 0(1) + O (1) O (1) (1) (1) (1) 0(1) O (n) + O (n) justifies to: CSS Code: #click { font-size: inheriti color: #FFF; background-color: #000; width: 10em; height: 3em

Output: Number of Operations:7018 Big O Notation Time Complexity: O1)+O)+O1)+O(1)+ O(1)+ o(1) + O(1)+O(1) +O1)+O1)+1) O(1) +O(n) +O(n) justifies to: O(n) O(1)+0(1)+ Index Number 0 Update Array

Update Array 92-Value of array index 0 77 = Value of array index 1 91 Value of array index 2 0-Value of array index 3 75 Value of array index 4 28 = Value of array index 5 19 Value of array index6 100-Value of array index 7 50 = Value of array index 8 15- Value of array index 9 26 Value of array index 10 39 Value of array index 11 18- Value of array index 12 50 Value of array index 13 4 -Value of array index 14 40-Value of array index 15 6 Value of array index 16 49 = Value of array index 17 60 Value of array index 18 17- Value of array index 19 62-Vlue of array index 20 86 Value of array index 21 28 Value of array index 22 97 Value of array index 23 38-Value of array index 24 30 Value of array index 25 13- Value of array index 26 56 = Value of array index 27 46 = Value of array index 28 25 Value of array index 29 7 Value of array index 30 95-Value of array index 31 96-Value of array index 32 30 Value of array index 33 43-Value of array index 34 29-Value of array index 35 43 = Value of array index 36 44 = Value of array index 37

Copyable Code:

Html Code:

<div id="operations1"></div><br>

<div id="operations2"></div><br>

<div id="find"></div><br>

<div id="find-option"></div><br>

<div id="form-array">   

    <form>

        Index:<br>

            <input type="text" name="index" id="index_value" value="3"><br>

        Number:<br>

            <input type="text" name="number" id="number" value="0"><br><br>

    </form>      

    <input type="submit" id="click" value="Update Array"><br><br>

</div>

<div id="updated-array"></div>

JAVASCRIPT CODE:

var array = new Array(1000);

document.getElementById("click").onclick = function() {myFormSubmit()};

function myFormSubmit() { //O(1)

    var index_entered = document.getElementById("index_value").value; //O(1)

    var number_entered = document.getElementById("number").value; //O(1)

    document.getElementById('updated-array').innerHTML = InsertIntoArray(array, index_entered, number_entered); //O(1)

}

function InsertIntoArray(array, index, number) { //O(1)

   

    for(var a=0; a<array.length;a++){ // O(N) //do multiple times

       //array[a] = a;

       array[a] = Math.floor((Math.random() * 100) + 1); // O(1)  

      

    }        

   

   

    //accept user input as number

    array[index] = number; // O(1)

   

    //printing output

    var updated_array = "";

    for (i = 0; i < array.length; i++) { // O(N)

   

        updated_array += array[i] + " = Value of array index " + i + "<br>"; // O(1) //1000

    }

    return document.getElementById('updated-array').innerHTML = updated_array; // O(1)

}

// Count the number of operations performed on the array and output this to the screen.

document.getElementById('operations1').innerHTML = "Number of Operations:7018";

// Time Complexity using Big O Notation

document.getElementById('operations2').innerHTML = "Big O Notation Time Complexity: O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(n) + O(n) justifies to: O(n)";

CSS Code:

#click {

    font-size: inherit;

    color: #FFF;

    background-color: #000;

    width: 10em;

    height: 3em;

}

PART 2: Add the function into the javascript: var count-0; function SearchArray2 (array, find) for (var a-0 a<array.lengthi a)/ o(N) array[a]Math floor ( (Math. random ) 100) 1) I/ o(1) for (var i-0 i < arrav. legth: i++ if (array [i] -- find) [ fi return ("Searched for "+ find + " and found it at index: count=count+1 ; return (find + "Not found") document.getElementById(' find-option ').innerHTML 50) Search Array2 (array, = // Time Complexity using Big O Notation document.getElement ById ('operations2) .inne rHTML,"Al Big o Notation Time Complexity o(1) O(1) 0 (1 o (1) 0 (1) o (1)0(1) o (1) + O (1) O (1) O (1) O (1) O (1) O (1) O (n) O (n) justifies to: O (n) "+count; document.getElementById('operations2') .inne rHTML"count of value-"+count;

Output:l count of value= 1 2 3 Searched for 50 and found it at index: 123 Index Number 0 Update Array 73 Value of array index。 45 Value of array index 1 73 Value of array index 2 0 = Value of array index 3 8 = Value of array index 4 6 Value of array index 5 /9 = Value of array index 6 3 = Value of array index 7 42 = Value of array index 8 84 Value of array index 9 17 = Value of array index 10 82 value of array index 11 13 Value of array index 12 29 Value of array index 13 81 = Value of array index 14 83 = Value of array index 15 38 = Value of array index 16 7 Value of array index 17 98 = Value of array index 18 99 = Value of array index 19 67 = Value of array index 20 53 Value of array index 21
Copyable Code:

var count=0;

function SearchArray2(array, find) {

    for(var a=0; a<array.length;a++){ // O(N)

       array[a] = Math.floor((Math.random() * 100) + 1); // O(1)         

    }

    for (var i=0; i < array.length; i++) {

        if (array[i] == find) {

            return ("Searched for " + find + " and found it at index: " + i);

          

        }

         count=count+1;

    }

    return (find + " Not found");

}

document.getElementById('find-option').innerHTML = SearchArray2(array, 50);

// Time Complexity using Big O Notation

document.getElementById('operations2').innerHTML = "A1 Big O Notation Time Complexity: O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(1) + O(n) + O(n) justifies to: O(n)"+count;

document.getElementById('operations2').innerHTML ="count of value="+count;