CRIMX crimx

## 有序比较.js
// O(m+n)
var foo = function(arrA, arrB) {

  var iB,
      iA;

  for (iA = iB = 0; iB < arrB.length; iB += 1) {
    while (arrB[iB] > arrA[iA] && iA < arrA.length) {
      iA += 1;
    }

## index.html
<!DOCTYPE html>
<html>
<head>
<script src="//code.jquery.com/jquery-2.1.1.min.js"></script>
  <meta charset="utf-8">
  <title>Test by Jesse</title>
</head>
<body>
<nav id = 'sidenav'>
  <ul>

## 递归寻后代.js

function getDescendants(node, n) {

  var res = [];

  function f(children, lev) {

    if (lev >= n) {
      res = res.concat(Array.prototype.slice.apply(children));
      return;

## 数组元素左最近最大.js
var arr = [],
    i;

for (i = 0; i < 10000; i++) {
  arr[i] = Math.floor(Math.random()*9999);
}

// console.log(arr);

function findLG(arr) {

## CountingSort.js
var arr = [];

for (var i=0; i< 10000; i++) {
  arr[i] = Math.floor(Math.random()*9997+1); //1~9998
}

// console.log(a);

function sort(arr) {


## 【算】字母包含问题.js
window.myApp = (function (myApp) {

  // O(m+n)
  myApp.containChar = function (Str1, Str2) {

    if (typeof Str1 !== "string" || typeof Str2 !== "string") {
      return;
    }

    var longStr,

## 【算】左旋转字符串.js
window.myApp = (function (myApp) {
  /*
   * 123456 --leftShift+2--> 345612
   * 1. 12 | 3456
   * 2. 21 | 3456
   * 3. 21 | 6543
   * 4. 216543
   * 5. 345621
   */
  myApp.leftShift = function (arr, offset) {

## compare.js
String.prototype.slice(start[,end]);      If a negative number is given, it is treated as strLength + start/end.

String.prototype.substr(start[,length]);  If a negative number is given to start, it is treated as strLength + start.

String.prototype.substring(indexA[,indexB]); If either argument is less than 0 or is NaN, it is treated as if it were 0.
                                          If either argument is greater than stringName.length, it is treated as if it were stringName.length.


var s1 = "0123456789"
console.log(s1.slice(3, 7));        //"3456"

## string reverse.c
void swap(char *a, char *b) {
    *a = *a^*b;
    *b = *a^*b;
    *a = *a^*b;
}

void reverse(char *a) {
    if(!a) return;
    int i, n = -1;
    while(a[++n]);

## Adapter.java
package com.crimx.adapter;

public class Adapter implements Plug2{
  private Plug1 plug1;

  public Adapter(Plug1 p1) {
    Plug1 = p1;
  }

  public void slot1() {
	// O(m+n)
	var foo = function(arrA, arrB) {

	var iB,
	iA;

	for (iA = iB = 0; iB < arrB.length; iB += 1) {
	while (arrB[iB] > arrA[iA] && iA < arrA.length) {
	iA += 1;
	}
	<!DOCTYPE html>
	<html>
	<head>
	<script src="//code.jquery.com/jquery-2.1.1.min.js"></script>
	<meta charset="utf-8">
	<title>Test by Jesse</title>
	</head>
	<body>
	<nav id = 'sidenav'>
	<ul>

	function getDescendants(node, n) {

	var res = [];

	function f(children, lev) {

	if (lev >= n) {
	res = res.concat(Array.prototype.slice.apply(children));
	return;
	var arr = [],
	i;

	for (i = 0; i < 10000; i++) {
	arr[i] = Math.floor(Math.random()*9999);
	}

	// console.log(arr);

	function findLG(arr) {
	var arr = [];

	for (var i=0; i< 10000; i++) {
	arr[i] = Math.floor(Math.random()*9997+1); //1~9998
	}

	// console.log(a);

	function sort(arr) {
	window.myApp = (function (myApp) {

	// O(m+n)
	myApp.containChar = function (Str1, Str2) {

	if (typeof Str1 !== "string" \|\| typeof Str2 !== "string") {
	return;
	}

	var longStr,
	window.myApp = (function (myApp) {
	/*
	* 123456 --leftShift+2--> 345612
	* 1. 12 \| 3456
	* 2. 21 \| 3456
	* 3. 21 \| 6543
	* 4. 216543
	* 5. 345621
	*/
	myApp.leftShift = function (arr, offset) {
	String.prototype.slice(start[,end]); If a negative number is given, it is treated as strLength + start/end.

	String.prototype.substr(start[,length]); If a negative number is given to start, it is treated as strLength + start.

	String.prototype.substring(indexA[,indexB]); If either argument is less than 0 or is NaN, it is treated as if it were 0.
	If either argument is greater than stringName.length, it is treated as if it were stringName.length.


	var s1 = "0123456789"
	console.log(s1.slice(3, 7)); //"3456"
	void swap(char a, char b) {
	a = a^*b;
	b = a^*b;
	a = a^*b;
	}

	void reverse(char *a) {
	if(!a) return;
	int i, n = -1;
	while(a[++n]);
	package com.crimx.adapter;

	public class Adapter implements Plug2{
	private Plug1 plug1;

	public Adapter(Plug1 p1) {
	Plug1 = p1;
	}

	public void slot1() {