Skip to content

Instantly share code, notes, and snippets.

Avatar
One coffee every five minute.

Anam Ahmed theanam

One coffee every five minute.
View GitHub Profile
View dragdroptouch.js
var DragDropTouch;
(function (DragDropTouch_1) {
'use strict';
/**
* Object used to hold the data that is being dragged during drag and drop operations.
*
* It may hold one or more data items of different types. For more information about
* drag and drop operations and data transfer objects, see
* <a href="https://developer.mozilla.org/en-US/docs/Web/API/DataTransfer">HTML Drag and Drop API</a>.
*
@theanam
theanam / gcd.js
Created Sep 29, 2015
Euclid's algorithm for finding GCD
View gcd.js
function gcd(a,b){
if(a==0 || b==0){
return a;
}
else{
return gcd(b,a%b);
}
}
//test
console.log(gcd(10,45));
@theanam
theanam / Sieve.js
Last active Sep 29, 2015
Sieve of Eratosthenes in JavaScript
View Sieve.js
/*
Sample Implementation of Sieve algorithm for 1-3000
not optimized yet
*/
var ar = [];
var max = 3000;
//loop should run only till the square root of the maximum
var maxloop = Math.round(Math.sqrt(max));
for(a=0;a<max;a++){
ar.push(true);
@theanam
theanam / quicksort.js
Last active Sep 29, 2015
Quick Sort algorithm in JavaScript (with a relatively bigger memory complexity, for demonstration purpose only)
View quicksort.js
var unsorted = [53,12,22,87,74,67,23,45,77,1,8,44];
function quickSort(arr){
if(arr.length<2)
return arr;
var smaller = [];
var larger = [];
var pivot = arr[Math.floor(Math.random()*arr.length)];
for(i=0;i<arr.length;i++){
if(arr[i]<=pivot)
smaller.push(arr[i])
@theanam
theanam / keybase.md
Created Jul 7, 2014
Keybase account proof
View keybase.md

Keybase proof

I hereby claim:

  • I am theanam on github.
  • I am theanam (https://keybase.io/theanam) on keybase.
  • I have a public key whose fingerprint is 9F55 C1A3 C36F F2F0 A2B9 46B8 0514 642C B259 A081

To claim this, I am signing this object:

You can’t perform that action at this time.