ankitdbst

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string.h>
#include <vector>
#include <string>
#include <cmath>
#include <stack>
#include <map>
#include <algorithm>

ankitdbst

/* 
 * Addition using bitwise operations
 */        
int binary_adder(int a, int b)
{
    int sum = 0, pos = 0;

    bool bit = 0, carry = 0;
    while(a || b) {
        // At each position i bitwise sum is the xor

ankitdbst

function doHash(str, seed) {
  var m = 0x5bd1e995;
  var r = 24;
  var h = seed ^ str.length;
  var length = str.length;
  var currentIndex = 0;
  
  while (length >= 4) {
    var k = UInt32(str, currentIndex);
    

ankitdbst

#include <iostream>
#include <string>
#include <vector>
using namespace std;

typedef vector<int> vi;
#define pb push_back
#define forn(a, b) for (int a = 0; a < b; ++a)
#define fore(a, b, c) for (int a = b; a < c; ++a)

ankitdbst

import java.io.*;
import java.util.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class SortLanguageStrings {
    private static final String REGEX = "\\$string\\[\\'(.*)\\'\\].*";

    public static void main( String args[] ) {
        // Compile pattern

ankitdbst

/**
 * Galerkin Method
 * Solving for y''+ ay' + by + f(x) = 0 
 * a, b are constants
 * y(u1) = v1, y(u2) = v2 BVP 
 */

#include <iostream>
#include <cmath>
using namespace std;

ankitdbst

Awesome PHP

A list of amazingly awesome PHP libraries, resources and shiny things.

Composer

• Composer/Packagist - A package and dependency manager.
• Composer Installers - A multi framework Composer library installer.

ankitdbst

/*
** Skip Lists data structures. Equivalent to Balanced Binary Trees
** Insert: O(LogN)
** Remove: O(LogN)
** Search: O(LogN) on average (worst case: O(N))
*/

#include <vector>
#include <ctime>
#include <cstdlib>

ankitdbst

todo-world

ankitdbst

$ echo '.idea' >> .gitignore
$ git rm -r --cached .idea
$ git add .gitignore
$ git commit -m '(some message stating you added .idea to ignored entries)'
$ git push