This repository has been archived by the owner on Dec 25, 2018. It is now read-only.
/
insertionSort.js.map
1 lines (1 loc) · 1.68 KB
/
insertionSort.js.map
1
{"version":3,"sources":["System/Collections/Array/Sorting/insertionSort.ts"],"names":[],"mappings":"AAAA;;;GAGG;OAII,EAAC,qBAAqB,EAAC,MAAM,2CAA2C;AAO/E,8BAAmD,MAAU;IAE5D,EAAE,CAAA,CAAC,CAAC,MAAM,CAAC;QAAC,MAAM,IAAI,qBAAqB,CAAC,QAAQ,CAAC,CAAC;IACtD,IAAI,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC;IAExB,GAAG,CAAA,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAC,GAAG,EAAE,CAAC,EAAE,EACzB,CAAC;QACA,IAAI,CAAC,GAAG,CAAC,EAAE,EAAS,CAAC;QAErB,OAAM,CAAC,GAAC,CAAC,IAAI,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,MAAM,CAAC,CAAC,CAAC,EAC3C,CAAC;YACA,IAAI,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;YACvB,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;YAClB,CAAC,EAAE,CAAC;QACL,CAAC;IACF,CAAC;IAED,MAAM,CAAC,MAAM,CAAC;AAEf,CAAC","file":"System/Collections/Array/Sorting/insertionSort.js","sourcesContent":["/*!\r\n * @author electricessence / https://github.com/electricessence/\r\n * Licensing: MIT https://github.com/electricessence/TypeScript.NET/blob/master/LICENSE.md\r\n */\r\n\r\n\r\nimport {Primitive} from \"../../../Primitive\";\r\nimport {ArgumentNullException} from \"../../../Exceptions/ArgumentNullException\";\r\n\r\n/**\r\n * https://en.wikipedia.org/wiki/Insertion_sort\r\n * @param target\r\n * @returns {T[]}\r\n */\r\nexport function insertionSort<T extends Primitive>(target:T[]):T[]\r\n{\r\n\tif(!target) throw new ArgumentNullException(\"target\");\r\n\tvar len = target.length;\r\n\r\n\tfor(let i = 1; i<len; i++)\r\n\t{\r\n\t\tlet j = i, j1:number;\r\n\r\n\t\twhile(j>0 && target[(j1 = j - 1)]>target[j])\r\n\t\t{\r\n\t\t\tlet swap = target[j];\r\n\t\t\ttarget[j] = target[j1];\r\n\t\t\ttarget[j1] = swap;\r\n\t\t\tj--;\r\n\t\t}\r\n\t}\r\n\r\n\treturn target;\r\n\r\n}\r\n"]}