Skip to content

Instantly share code, notes, and snippets.

@alnorris
alnorris / linkedlist.php
Created March 16, 2015 17:05
Linked List in PHP
<?php
class node {
public $data;
public $nextNode;
public function __construct($data, $nextNode) {
$this->data = $data;
@alnorris
alnorris / poweroftwo.php
Created March 16, 2015 17:17
Power of Two in PHP
<?php
$result = 1;
while($result <= 1024){
print $result . "\n";
$result = $result << 1;
}
var arr = [4,8,2,4,10,2,4];
for(var i = 0; i < arr.length; i++) {
for(var z = 0; z < arr.length-i; z++) {
if(arr[z] > arr[z+1]) {
//swap
var temp = arr[z];
arr[z] = arr[z+1]
arr[z+1] = temp;
<?php
$msg = "Hello World!";
for($i = 0; $i < (strlen($msg)-1)/2; $i++) {
$temp = $msg[$i];
$msg[$i] = $msg[strlen($msg)-1-$i];
$msg[strlen($msg)-1-$i] = $temp;
}
@alnorris
alnorris / centermiddlediv.css
Created September 6, 2015 20:05
Center middle a Div
/*
When changing the width and height, change the margin to a negative half sized value, and line height
/*
#centermiddle {
margin: -100px 0 0 -100px;
display: block;
border:1px solid red;
width: 200px ;
height: 200px;
@alnorris
alnorris / gist:6341976
Created August 26, 2013 14:26
List power of 2 with bitwise shift operater
int main(void) {
int i;
for(i = 1; i < 1024; printf("%d\n", i <<= 1)) {}
return 0;
}
@alnorris
alnorris / gist:6562389
Last active December 23, 2015 01:49
FizzBuzz implementation in PHP.
for($i = 1; $i <= 100; $i++) {
if(($i % 3) == 0 || ($i % 5) == 0) {
if(($i % 3) == 0) { echo "Fizz"; }
if(($i % 5) == 0) { echo "Buzz"; }
}
else { echo $i; }
echo "<br />";
}
@alnorris
alnorris / gist:6710436
Last active December 23, 2015 23:29
Linked list in Javascript
function node(data, next) {
this.data = data;
this.next = next;
}
function linkedlist() {
this.first = null;
}
linkedlist.prototype.insertNode = function(data) {
@alnorris
alnorris / mergeSorted.js
Created May 10, 2016 19:49
Merge 2 sorted arrays
var arr1 = [3,5,8,10,15,18];
var arr2 = [6,10,15,20,25];
function sort(arr1, arr2) {
var sortedArr = [];
var x = y = 0;
while(x < arr1.length && y < arr2.length) {
if(arr1[x] < arr2[y]) {
sortedArr.push(arr1[x++]);
function promiseAll(arr) {
// fill this in
}
promiseAll([Promise.resolve(1), Promise.resolve(4)]).then(resp => {
console.log(resp)
})