Valentyna Gorbachenko ValentynaGorbachenko

## README.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                ValentynaGorbachenko
                / README.md
            
            
              Created
              June 19, 2017 17:38
                — forked from joyrexus/README.md
            
              
                Vanilla JS equivalents of jQuery methods
              
          
    Sans jQuery

Events

// jQuery
$(document).ready(function() {
  // code
})

  
## nodejs-cheatsheet.js
// Node.js CheatSheet.
// Download the Node.js source code or a pre-built installer for your platform, and start developing today.
// Download: http://nodejs.org/download/
// More: http://nodejs.org/api/all.html


// 0. Synopsis.
// http://nodejs.org/api/synopsis.html

## README-Template.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                ValentynaGorbachenko
                / README-Template.md
            
            
              Created
              November 27, 2016 19:33
                — forked from PurpleBooth/README-Template.md
            
              
                A template to make good README.md
              
          
    Project Title

One Paragraph of project description goes here
Getting Started

These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. See deployment for notes on how to deploy the project on a live system.
Prerequisites


## insertion_sort.js
// O(n^2) - time complexity
// O(1) - space complexity

// insertion sort
function insertionSort(arr){
	// start loop from the second element in the Array
	for (var i=1; i<arr.length; i++){
		// store current elem
		var temp = arr[i];
		// start comparing current elem to the previous

## binary_search.js
 // O(log(n)) - time complexity
 // O(n) - space complexity

 function binarySearch(arr,val){
 	if (arr.length === 0){return -1;}
 	var li = 0;
 	var hi = arr.length-1;

 	while(li<=hi){
 		var mid = Math.floor(li+(hi-li)/2);

## SLL_Node.js

function SLL(){
	this.head = null;
}

function Node(val){
	this.val = val;
	this.next = null;
}

## index.css
body {
      text-align: center;
      background: #5c5c5c url("http://gorbachenko.byethost18.com/assets/background_picture.png") ;
      background-size: cover;
      background-position: center top left;
      color: white;
      font-family: helvetica;
    }
    p {
      font-size: 22px;

## index.css
header {
      text-align: center;
      background: url('http://gorbachenko.byethost18.com/assets/blog_bg2.png');
      background-size: cover;
      color: white;
    }
    a {
      text-decoration: none;
      color: white;
    }

## index.css
body {
  font-family: helvetica, sans-serif;
  margin: 0 auto;
  /*max-width: 600px;*/
  background: #232323;
}
div {
  height: 200px;
  background-size: cover;
  position: relative;

## objects_inheritance.js
//Objects
var literalObject = {
  name: "literalObject",
  property1: "some data", //string
  property2: 3, // number
  property3: [], //array
  property4: {},
  method1: function(){
    var result = [];
    for (var prop in this) {
	// Node.js CheatSheet.
	// Download the Node.js source code or a pre-built installer for your platform, and start developing today.
	// Download: http://nodejs.org/download/
	// More: http://nodejs.org/api/all.html


	// 0. Synopsis.
	// http://nodejs.org/api/synopsis.html
	// O(n^2) - time complexity
	// O(1) - space complexity

	// insertion sort
	function insertionSort(arr){
	// start loop from the second element in the Array
	for (var i=1; i<arr.length; i++){
	// store current elem
	var temp = arr[i];
	// start comparing current elem to the previous
	// O(log(n)) - time complexity
	// O(n) - space complexity

	function binarySearch(arr,val){
	if (arr.length === 0){return -1;}
	var li = 0;
	var hi = arr.length-1;

	while(li<=hi){
	var mid = Math.floor(li+(hi-li)/2);

	function SLL(){
	this.head = null;
	}

	function Node(val){
	this.val = val;
	this.next = null;
	}
	body {
	text-align: center;
	background: #5c5c5c url("http://gorbachenko.byethost18.com/assets/background_picture.png") ;
	background-size: cover;
	background-position: center top left;
	color: white;
	font-family: helvetica;
	}
	p {
	font-size: 22px;
	header {
	text-align: center;
	background: url('http://gorbachenko.byethost18.com/assets/blog_bg2.png');
	background-size: cover;
	color: white;
	}
	a {
	text-decoration: none;
	color: white;
	}
	body {
	font-family: helvetica, sans-serif;
	margin: 0 auto;
	/max-width: 600px;/
	background: #232323;
	}
	div {
	height: 200px;
	background-size: cover;
	position: relative;
	//Objects
	var literalObject = {
	name: "literalObject",
	property1: "some data", //string
	property2: 3, // number
	property3: [], //array
	property4: {},
	method1: function(){
	var result = [];
	for (var prop in this) {