Skip to content

Instantly share code, notes, and snippets.

View juanigallo's full-sized avatar
🚀

Juani Gallo juanigallo

🚀
View GitHub Profile
@juanigallo
juanigallo / checkSum.js
Created September 8, 2017 18:08
Check sum of ordered array with JavaScript
function checkSum(arr, sum) {
let low = 0,
high = arr.length - 1;
while(low < high) {
let s = arr[low] + arr[high];
if (s === sum) return true
if (s < sum) {
low = low + 1
@juanigallo
juanigallo / fizzbuzz.js
Created September 8, 2017 15:19
FizzBuzz implementation in JavaScript.
function fizzBuzz(to) {
for (var i=1; i <= to; i++) {
if (i % 15 == 0)
console.log("FizzBuzz");
else if (i % 3 == 0)
console.log("Fizz");
else if (i % 5 == 0)
console.log("Buzz");
else
console.log(i);
@juanigallo
juanigallo / mergesort.js
Created September 8, 2017 13:45
MergeSort implementation in JavaScript
function mergeSort (arr) {
if (arr.length < 2) {
return arr;
}
var mid = Math.floor(arr.length / 2);
var subLeft = mergeSort(arr.slice(0, mid));
var subRight = mergeSort(arr.slice(mid));
return merge(subLeft, subRight);
@juanigallo
juanigallo / quicksort.js
Created September 8, 2017 13:41
QuickSort implementation in JavaScript
var quickSort = function(array, left, right){
var leftIndex = partition(array, left, right);
if (left < leftIndex - 1){
quickSort(array, left, leftIndex-1);
}
if (right > leftIndex){
quickSort(array, leftIndex, right);
@juanigallo
juanigallo / BubbleSort.js
Last active September 8, 2017 13:39
BubbleSort implementation in JavaScript
function bubbleSort(arr) {
for (var i = 0; i < arr.length - 1; i++) {
for(var j = 0; j < arr.length - i - 1; j++ ) {
if (arr[j] > arr[j + 1]) {
var temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}