/**
	 * 函數(shù)性能比較
	 * @param fns 要比較的函數(shù)數(shù)組
	 * @args 每個(gè)要比較函數(shù)在執(zhí)行的時(shí)候傳入的參數(shù),可以是數(shù)組,或者 被調(diào)用后 返回?cái)?shù)組類型
	 * @repeatCount 每個(gè)函數(shù)重復(fù)執(zhí)行的次數(shù),多次執(zhí)行 拉開差距。默認(rèn)值10000
	 * 
	 * @return [{runTime:執(zhí)行repeatCount次總時(shí)間,repeatCount:重復(fù)執(zhí)行次數(shù),name:函數(shù)名稱,chrome是函數(shù)名,IE由于不支持funciton.name,所以默認(rèn) fn+函數(shù)在fns中index}]
	 * */
	function proferencesCompare(fns, args, repeatCount) {
		var tmpArgs, tmpFns;
		var result = [];
		var starTime, endTime;
		var i = 0;
		var repeatCount = repeatCount || 10000;
		var isFunction = false;
		if(fns === undefined) {
			throw Error('Must have the compare funciton');
		}
 
		var typeName = typeof args;
 
		//檢測傳入的args是否能夠返回array類型數(shù)據(jù)
		if(typeName === 'function') {
			tmpArgs = args();
			isFunction = true;
		}
 
		if(typeName === 'number') {
			tmpArgs = [];
			repeatCount = args;
		}
 
		//檢測args 是否為 array
		if(Object.prototype.toString.call(tmpArgs) !== '[object Array]') {
			throw Error('The test args is must a array or a function which return the array');
		}
 
		var len = fns.length;
		for(; i < len; i++) {
			var fnName = fns[i].name || "fn" + i;
			starTime = Date.now();
			console.time(fnName);
			for(var j = 0; j < repeatCount; j++) {
				if(isFunction && (i !== 0 || j !== 0)) {
					//如果args是函數(shù),并且循環(huán)是第一次進(jìn)入,則不需要再執(zhí)行一次。前面做args檢測時(shí)已經(jīng)執(zhí)行過一次
					tmpArgs = args();
				}
				fns[i].apply(this, tmpArgs);
			}
			console.timeEnd(fnName);
			endTime = Date.now();
			result.push({ runTime: endTime - starTime, repeatCount: repeatCount, name: fnName });
		}
		return result;
	}

var fn1 = function() {
		var a;
		return !a;
	}
 
var fn2 = function() {
		var a;
		return a === undefined;
	}
 
var fn3 = function() {
		var a;
		return a == undefined;
	}
 
var result = proferencesCompare([fn1, fn2, fn3, fn3, fn2, fn1], 1000000000);

int[] array = { 15,20,10,3,5};
Stopwatch sw = new Stopwatch();
sw.Start();

for (int i = 0; i < array.Length - 1; i++) {
  for (int j = i + 1; j < array.Length; j++) {
    if (array[i] > array[j]) {

      int temp = array[i];
      array[i] = array[j];
      array[j] = temp;
    }
  }
}
sw.Stop();
Console.WriteLine(sw.Elapsed);