Видул Петров vidul-nikolaev-petrov

## checkBalancedBrackets.js
function checkBalance(s) {
    if (s.length % 2 !== 0) return false;

    if (s.length === 0) return true;

    var pairs = ['[]', '()', '{}'],
        r0 = s.split(pairs[0]),
        r1 = s.split(pairs[1]),
        r2 = s.split(pairs[2]);

## bubble_sort.js
function bubbleSort(array) {
    var swapped;

    for (var i = 0; i < array.length - 1; i++) {
        if (array[i] > array[i + 1]) {
            var tmp = array[i + 1];
            array[i + 1] = array[i];
            array[i] = tmp;
            swapped = true;
        }

## webpage-crypto.html
<!doctype html>
<html>
<head>
    <meta charset="utf-8">
    <script>
    /*
    CryptoJS v3.1.2
    code.google.com/p/crypto-js
    (c) 2009-2013 by Jeff Mott. All rights reserved.
    code.google.com/p/crypto-js/wiki/License

## todo_git-config-aliases
[alias]

    # add task
    a = "!f() { \
                if [[ -f .dummy ]]; then \
                    git rm -f .dummy; \
                else \
                    touch .dummy; \
                    git add .dummy; \
                fi; \

## pki_aes.js
/**
 * @author Vidul Nikolaev Petrov
 * @summary helper methods for PKI / AES usage, based on the JS Forge crypto library.
 */

function s8Crypto(bits) {
    var hexToBytes = forge.util.hexToBytes,
        bytesToHex = forge.util.bytesToHex;

    this.pki = {};

## longest_common_substring.js
/**
 * Longest Common Substring in JavaScript
 *
 * This is the brute-force solution.
 *
 * @param {String} s1
 * @param {String} s2
 * @return {String} r1
 */

## soundex.js
/**
 * Soundex in JavaScript
 *
 * @example
 * // returns 'H416'
 * soundex('Heilbronn');
 *
 * @example
 * // returns 'L222'
 * soundex('Lissajous');

## insertion_sort.js
function insertionSort(list) {
     for (var g = 0; g < list.length; g++) {
         for (var i = list.length - 1; i > g; i--) {
             if (list[i] < list[i - 1]) {
                 var tmp = list[i];
                 list[i] = list[i - 1];
                 list[i - 1] = tmp;
             }
         }
     }

## quick_sort.js
function quickSort(list) {
    if (!list.length) return [];

    var left = [],
        right = [],
        center = list[0];

    for (var i = 1; i < list.length; i++) {
        if (list[i] < center) {
            left.push(list[i]);

## hanoi.js
/**
 * Thst is not the optimal formula, don't use it.
 * This is just another solution for the algorithm
 * Tower of Hanoi.
 */

if (Array.prototype.last === undefined) {
    Array.prototype.last = function () {
        return this.length ? this[this.length - 1] : 0;
    };
	function checkBalance(s) {
	if (s.length % 2 !== 0) return false;

	if (s.length === 0) return true;

	var pairs = ['[]', '()', '{}'],
	r0 = s.split(pairs[0]),
	r1 = s.split(pairs[1]),
	r2 = s.split(pairs[2]);
	function bubbleSort(array) {
	var swapped;

	for (var i = 0; i < array.length - 1; i++) {
	if (array[i] > array[i + 1]) {
	var tmp = array[i + 1];
	array[i + 1] = array[i];
	array[i] = tmp;
	swapped = true;
	}
	<!doctype html>
	<html>
	<head>
	<meta charset="utf-8">
	<script>
	/*
	CryptoJS v3.1.2
	code.google.com/p/crypto-js
	(c) 2009-2013 by Jeff Mott. All rights reserved.
	code.google.com/p/crypto-js/wiki/License
	[alias]

	# add task
	a = "!f() { \
	if [[ -f .dummy ]]; then \
	git rm -f .dummy; \
	else \
	touch .dummy; \
	git add .dummy; \
	fi; \
	/**
	* @author Vidul Nikolaev Petrov
	* @summary helper methods for PKI / AES usage, based on the JS Forge crypto library.
	*/

	function s8Crypto(bits) {
	var hexToBytes = forge.util.hexToBytes,
	bytesToHex = forge.util.bytesToHex;

	this.pki = {};
	/**
	* Longest Common Substring in JavaScript
	*
	* This is the brute-force solution.
	*
	* @param {String} s1
	* @param {String} s2
	* @return {String} r1
	*/
	/**
	* Soundex in JavaScript
	*
	* @example
	* // returns 'H416'
	* soundex('Heilbronn');
	*
	* @example
	* // returns 'L222'
	* soundex('Lissajous');
	function insertionSort(list) {
	for (var g = 0; g < list.length; g++) {
	for (var i = list.length - 1; i > g; i--) {
	if (list[i] < list[i - 1]) {
	var tmp = list[i];
	list[i] = list[i - 1];
	list[i - 1] = tmp;
	}
	}
	}
	function quickSort(list) {
	if (!list.length) return [];

	var left = [],
	right = [],
	center = list[0];

	for (var i = 1; i < list.length; i++) {
	if (list[i] < center) {
	left.push(list[i]);
	/**
	* Thst is not the optimal formula, don't use it.
	* This is just another solution for the algorithm
	* Tower of Hanoi.
	*/

	if (Array.prototype.last === undefined) {
	Array.prototype.last = function () {
	return this.length ? this[this.length - 1] : 0;
	};