Ibrahim Banat ibrahimBanat

## main.html
<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Lab 01b</title>
    <style>
        .heading {
            text-align: center;

## server.js
'use strict';

const express = require('express');
const cors = require('cors');
const app = express();
const path = require('path');
const server = require('http').createServer(app);
const socket = require('socket.io');
const io = socket(server, {
  cors: { origin: '*' },

## bigo.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                ibrahimBanat
                / bigo.md
            
            
              Created
              June 20, 2021 22:16
            
          
Growth Rate
Name


1
Constant


log(n)
Logarithmic


n
Linear


n log(n)
Linearithmic


n^2
Quadratic


n^3
Cubic


2^n
Exponential


## insertionSort1.js
function insertSort(array) {
  //creating insertion sort function
}

## i1.js
function insertSort(array) {
  //creating insertion sort function
}

## i2.js
function insertSort(array) {
  for (let item = 1; item < array.length; item++) {
    //looping through the input list
  }
}

## i3.js
function insertSort(array) {
  for (let item = 1; item < array.length; item++) {
    for (let index = item; index > 0; index--) {
      //looping through the sub-sorted array down
      //to the first eleemnt
    }
  }
}

## i4.js
function insertSort(array) {
  for (let item = 1; item < array.length; item++) {
    for (let index = item; index > 0; index--) {
      if (array[index] < array[index - 1]) {
        const temp = array[index];
        array[index] = array[index - 1];
        array[index - 1] = temp;
      }
    }
  }

## i5.js
function insertSort(array) {
  for (let item = 1; item < array.length; item++) {
    for (let index = item; index > 0; index--) {
      if (array[index] < array[index - 1]) {
        const temp = array[index];
        array[index] = array[index - 1];
        array[index - 1] = temp;
      } else {
        break;
      }

## i7.js
function insertSort(array) {
  for (let item = 1; item < array.length; item++) {
    for (let index = item; index > 0; index--) {
      if (array[index] < array[index - 1]) {
        const temp = array[index];
        array[index] = array[index - 1];
        array[index - 1] = temp;
      } else {
        break;
      }
	<!DOCTYPE html>
	<html lang="en">
	<head>
	<meta charset="UTF-8">
	<meta http-equiv="X-UA-Compatible" content="IE=edge">
	<meta name="viewport" content="width=device-width, initial-scale=1.0">
	<title>Lab 01b</title>
	<style>
	.heading {
	text-align: center;
	'use strict';

	const express = require('express');
	const cors = require('cors');
	const app = express();
	const path = require('path');
	const server = require('http').createServer(app);
	const socket = require('socket.io');
	const io = socket(server, {
	cors: { origin: '*' },
Growth Rate	Name
1	Constant
log(n)	Logarithmic
n	Linear
n log(n)	Linearithmic
n^2	Quadratic
n^3	Cubic
2^n	Exponential
	function insertSort(array) {
	//creating insertion sort function
	}
	function insertSort(array) {
	for (let item = 1; item < array.length; item++) {
	//looping through the input list
	}
	}
	function insertSort(array) {
	for (let item = 1; item < array.length; item++) {
	for (let index = item; index > 0; index--) {
	//looping through the sub-sorted array down
	//to the first eleemnt
	}
	}
	}