Raising bugs

Ibrahim Banat ibrahimBanat

Raising bugs

I am like the poet, works only slightly removed from pure thought-stuff

ibrahimBanat / main.html

Created February 14, 2021 13:07

odai al-fawair //// and ibrahim banat

	<!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;

ibrahimBanat / server.js

Created June 2, 2021 19:35

asdfadsfer

	'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: '*' },

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

ibrahimBanat / insertionSort1.js

Created June 20, 2021 22:25

	function insertSort(array) {
	//creating insertion sort function
	}

ibrahimBanat / i1.js

Created June 20, 2021 22:28

	function insertSort(array) {
	//creating insertion sort function
	}

ibrahimBanat / i2.js

Created June 20, 2021 22:28

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

ibrahimBanat / i3.js

Created June 20, 2021 22:29

	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
	}
	}
	}

ibrahimBanat / i4.js

Created June 20, 2021 22:30

	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;
	}
	}
	}

ibrahimBanat / i5.js

Created June 20, 2021 22:30

	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;
	}

ibrahimBanat / i7.js

Created June 20, 2021 22:32

	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;
	}