{"_id":"sort-algo","_rev":"29-cfbbc537325f5fb034b1f2e6c00e36c0","name":"sort-algo","description":"sort an array","dist-tags":{"latest":"0.3.0"},"versions":{"0.1.0":{"name":"sort-algo","description":"sort an array","version":"0.1.0","author":{"name":"guillaume derouineau","email":"admin@caradoc.fr"},"dependencies":{},"keywords":["sort","algo","algorithm","insertion"],"main":"index","readmeFilename":"Readme.md","_id":"sort-algo@0.1.0","_from":".","homepage":"http://github.com/gderouineau/sort-algo","repository":{"type":"git","url":"http://github.com/gderouineau/sort-algo.git"},"readme":"\n## Insertion sort\n\nComplexity :  worst : n2 , average n2 , best n where n is the number of elements in the given array\n\nFast algorithm if the array contain a maximum of 15 elements.\n\n```js\nvar insertion = require('sort-algo').insertion;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertion(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n\n\n## Quick sort\n\nComplexity :  worst : n2 , average n log n , best n log n  where n is the number of elements in the given array\n\ncf : wiki Quick sort\n\n```js\nvar quickSort = require('sort-algo').quick;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\nquickSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n","bugs":{"url":"https://github.com/gderouineau/sort-algo/issues"},"dist":{"shasum":"e0b13e3af8ebc39fdcec6c2836c3d6fd850edc31","tarball":"https://registry.npmjs.org/sort-algo/-/sort-algo-0.1.0.tgz","integrity":"sha512-M+x3e7l6bLCDbQjxjZpMSlVNndADZu4+Ye77FPJa0ETckl6tAdeU1rdPI3vR4feEVcoLRhgscfOY0o3CcT4OHA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQClejRyKSGRQt008g52XmlULtnuM2ISGzS/l+v+IvDYQwIgShL7HRZ4sZOf89voFZtjrJBcG29HWJ1AFGM99mbWtLQ="}]},"_npmVersion":"1.3.11","_npmUser":{"name":"goten","email":"admin@caradoc.fr"},"maintainers":[{"name":"goten","email":"admin@caradoc.fr"}],"directories":{}},"0.1.1":{"name":"sort-algo","description":"sort an array","version":"0.1.1","author":{"name":"guillaume derouineau","email":"guillaume.derouineau@gmail.com"},"dependencies":{},"keywords":["sort","algo","algorithm","insertion"],"main":"index","readmeFilename":"Readme.md","_id":"sort-algo@0.1.1","_from":".","homepage":"http://github.com/gderouineau/sort-algo","repository":{"type":"git","url":"http://github.com/gderouineau/sort-algo.git"},"readme":"\n## Insertion sort\n\nComplexity :  worst : n2 , average n2 , best n where n is the number of elements in the given array\n\nFast algorithm if the array contain a maximum of 15 elements.\n\n```js\nvar insertion = require('sort-algo').insertion;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertion(array, function(err, sortArray){\n    if(err) console.log(err);\n    console.log(sortArray);\n});\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n\n\n## Quick sort\n\nComplexity :  worst : n2 , average n log n , best n log n  where n is the number of elements in the given array\n\ncf : wiki Quick sort\n\n```js\nvar quickSort = require('sort-algo').quick;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\nquickSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n","bugs":{"url":"https://github.com/gderouineau/sort-algo/issues"},"dist":{"shasum":"a1a026103e5356c7137c9ad2c55d8f5fa06c2018","tarball":"https://registry.npmjs.org/sort-algo/-/sort-algo-0.1.1.tgz","integrity":"sha512-ETSbRuZwtBAurx/NFFLnJHypWnLkDSGA60zFJt6MQKoPF8sj25Wey3GCkWFfd96PCW6Z1vqDJ7ZSAsxGXWlO0g==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIE5JgofzFGV9HaO3N7jF5mL8t00ONZE3Lch4jziIsggjAiB/NFuHQRed8pqLA1ZjwJqr/qlurWDFRSOFccgudb+rwg=="}]},"_npmVersion":"1.3.11","_npmUser":{"name":"goten","email":"admin@caradoc.fr"},"maintainers":[{"name":"goten","email":"admin@caradoc.fr"}],"directories":{}},"0.1.2":{"name":"sort-algo","description":"sort an array","version":"0.1.2","author":{"name":"guillaume derouineau","email":"guillaume.derouineau@gmail.com"},"dependencies":{},"keywords":["sort","algo","algorithm","insertion"],"main":"index","readmeFilename":"Readme.md","_id":"sort-algo@0.1.2","_from":".","homepage":"http://github.com/gderouineau/sort-algo","repository":{"type":"git","url":"http://github.com/gderouineau/sort-algo.git"},"readme":"\n## Insertion sort\n\nComplexity :  worst : n2 , average n2 , best n where n is the number of elements in the given array\n\nFast algorithm if the array contain a maximum of 15 elements.\n\n```js\nvar insertion = require('sort-algo').insertion;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertion(array, function(err, sortArray){\n    if(err) console.log(err);\n    console.log(sortArray);\n});\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n\n\n## Quick sort\n\nComplexity :  worst : n2 , average n log n , best n log n  where n is the number of elements in the given array\n\ncf : wiki Quick sort\n\n```js\nvar quickSort = require('sort-algo').quick;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\nquickSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n","bugs":{"url":"https://github.com/gderouineau/sort-algo/issues"},"dist":{"shasum":"3589a956349022344b366f0ff5e8d64dfd320476","tarball":"https://registry.npmjs.org/sort-algo/-/sort-algo-0.1.2.tgz","integrity":"sha512-sgPGWnUELV/rlskZfNLOiu6UuV6m0mhtXnEnCAJy5oLIQ698xwLuzdexe33r8ifrGHk5HUhuTBU7elfUlvJlfA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIGd1x/OODakci49zRYFzViwayPG2tgjZnYznbwqORAweAiEA6Th7v1TB5G4+Y5FbeB9hZ9LO//JOT+4QVTJLhb8biDQ="}]},"_npmVersion":"1.3.11","_npmUser":{"name":"goten","email":"admin@caradoc.fr"},"maintainers":[{"name":"goten","email":"admin@caradoc.fr"}],"directories":{}},"0.2.0":{"name":"sort-algo","description":"sort an array","version":"0.2.0","author":{"name":"guillaume derouineau","email":"guillaume.derouineau@gmail.com"},"dependencies":{},"keywords":["sort","algo","algorithm","insertion"],"main":"index","readmeFilename":"Readme.md","_id":"sort-algo@0.2.0","_from":".","homepage":"http://github.com/gderouineau/sort-algo","repository":{"type":"git","url":"http://github.com/gderouineau/sort-algo.git"},"readme":"\n## Insertion sort\n\nComplexity :  worst : n2 , average n2 , best n where n is the number of elements in the given array\n\nFast algorithm if the array contain a maximum of 15 elements.\n\n```js\nvar insertion = require('sort-algo').insertion;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertion(array, function(err, sortArray){\n    if(err) console.log(err);\n    console.log(sortArray);\n});\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n### Insertion Synchronous sort\n\nSame as insertion sort but the synchronous way\n\n```js\n\nvar insertionSyncSort = require('sort-algo').insertionSync;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertionSyncSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n\n\n## Quick sort\n\nComplexity :  worst : n2 , average n log n , best n log n  where n is the number of elements in the given array\n\ncf : wiki Quick sort\n\n```js\nvar quickSort = require('sort-algo').quick;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\nquickSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n","bugs":{"url":"https://github.com/gderouineau/sort-algo/issues"},"dist":{"shasum":"f9dcf78971a90b6ac0895f9670b28b23a0d2fc35","tarball":"https://registry.npmjs.org/sort-algo/-/sort-algo-0.2.0.tgz","integrity":"sha512-7C5CozrOatsVfWQpkJTZR2PHjFokE4rASrQOyqmkVv4HWL5Nmh7fsNDV8JN1tJMjDTLdA0XXut83fprJOaTwyQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCPSunH2bXc6eCSEA4Os/Q7PmyIUePW9/CNx/+GsfbtkwIhAL9H1f81o1OOSs6aBE3EI1x7Ie2RqQ3qy/d3yUNm0yWk"}]},"_npmVersion":"1.3.11","_npmUser":{"name":"goten","email":"admin@caradoc.fr"},"maintainers":[{"name":"goten","email":"admin@caradoc.fr"}]},"0.2.1":{"name":"sort-algo","description":"sort an array","version":"0.2.1","author":{"name":"guillaume derouineau","email":"guillaume.derouineau@gmail.com"},"dependencies":{},"keywords":["sort","algo","algorithm","insertion"],"main":"index","readmeFilename":"Readme.md","_id":"sort-algo@0.2.1","_from":".","homepage":"http://github.com/gderouineau/sort-algo","repository":{"type":"git","url":"http://github.com/gderouineau/sort-algo.git"},"readme":"\n## Insertion sort\n\nComplexity :  worst : n2 , average n2 , best n where n is the number of elements in the given array\n\nFast algorithm if the array contain a maximum of 15 elements.\n\n```js\nvar insertion = require('sort-algo').insertion;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertion(array, function(err, sortArray){\n    if(err) console.log(err);\n    console.log(sortArray);\n});\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n### Insertion Synchronous sort\n\nSame as insertion sort but the synchronous way\n\n```js\n\nvar insertionSyncSort = require('sort-algo').insertionSync;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertionSyncSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n\n\n## Quick sort\n\nComplexity :  worst : n2 , average n log n , best n log n  where n is the number of elements in the given array\n\ncf : wiki Quick sort\n\n```js\nvar quickSort = require('sort-algo').quick;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\nquickSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n","bugs":{"url":"https://github.com/gderouineau/sort-algo/issues"},"dist":{"shasum":"0758ac71cbd029748df9d539af441014124d75ca","tarball":"https://registry.npmjs.org/sort-algo/-/sort-algo-0.2.1.tgz","integrity":"sha512-R+sV9pQ4nomhdtiVIrM12z9atBZ2kpdxY4O++jNmEv3MJ0sS50hnRq1rtpuvbMUnMDf8d9ZVe7EfNmg0HRvGag==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIDMouvIIqqvvGbdzn082dkwQdP755kAyaUiuniFNun5FAiBiLtwXRvXZwSswaeCN3BMow7Gq31pCJs4wByCMVodQiA=="}]},"_npmVersion":"1.3.11","_npmUser":{"name":"goten","email":"admin@caradoc.fr"},"maintainers":[{"name":"goten","email":"admin@caradoc.fr"}]},"0.2.2":{"name":"sort-algo","description":"sort an array","version":"0.2.2","author":{"name":"guillaume derouineau","email":"guillaume.derouineau@gmail.com"},"dependencies":{},"keywords":["sort","algo","algorithm","insertion"],"main":"index","readmeFilename":"Readme.md","_id":"sort-algo@0.2.2","_from":".","homepage":"http://github.com/gderouineau/sort-algo","repository":{"type":"git","url":"http://github.com/gderouineau/sort-algo.git"},"readme":"\n## Insertion sort\n\nComplexity :  worst : n2 , average n2 , best n where n is the number of elements in the given array\n\nFast algorithm if the array contain a maximum of 15 elements.\n\n```js\nvar insertion = require('sort-algo').insertion;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertion(array, function(err, sortArray){\n    if(err) console.log(err);\n    console.log(sortArray);\n});\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n### Insertion Synchronous sort\n\nSame as insertion sort but the synchronous way\n\n```js\n\nvar insertionSyncSort = require('sort-algo').insertionSync;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertionSyncSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n\n\n## Quick sort\n\nComplexity :  worst : n2 , average n log n , best n log n  where n is the number of elements in the given array\n\ncf : wiki Quick sort\n\n```js\nvar quickSort = require('sort-algo').quick;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\nquickSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n","bugs":{"url":"https://github.com/gderouineau/sort-algo/issues"},"dist":{"shasum":"0be336e0ca84770a84ac0f338cb929333941a82d","tarball":"https://registry.npmjs.org/sort-algo/-/sort-algo-0.2.2.tgz","integrity":"sha512-U5AfNLYhxFlLWKovGoaiJQx4f2BY3B1uUW3xgwnbT+2X3lD3hJm/aAtCItMzsubob91RXIAGtubgBqdUyhPkeA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIH+ultisLcxDIWSBfV06YWTg2NXB9YQ4nhIGyD5Iv3BSAiEApT8F4HW0MTwv6Ks5HnW7rVzFweDYnl6SOLCaIjkTAnU="}]},"_npmVersion":"1.3.11","_npmUser":{"name":"goten","email":"admin@caradoc.fr"},"maintainers":[{"name":"goten","email":"admin@caradoc.fr"}]},"0.2.3":{"name":"sort-algo","description":"sort an array","version":"0.2.3","author":{"name":"guillaume derouineau","email":"guillaume.derouineau@gmail.com"},"dependencies":{},"keywords":["sort","algo","algorithm","insertion"],"main":"index","readmeFilename":"Readme.md","_id":"sort-algo@0.2.3","_from":".","homepage":"http://github.com/gderouineau/sort-algo","repository":{"type":"git","url":"http://github.com/gderouineau/sort-algo.git"},"readme":"\n## Insertion sort\n\nComplexity :  worst : n2 , average n2 , best n where n is the number of elements in the given array\n\nFast algorithm if the array contain a maximum of 15 elements.\n\n```js\nvar insertion = require('sort-algo').insertion;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertion(array, function(err, sortArray){\n    if(err) console.log(err);\n    console.log(sortArray);\n});\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n### Insertion Synchronous sort\n\nSame as insertion sort but the synchronous way\n\n```js\n\nvar insertionSyncSort = require('sort-algo').insertionSync;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertionSyncSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n\n\n## Quick sort\n\nComplexity :  worst : n2 , average n log n , best n log n  where n is the number of elements in the given array\n\ncf : wiki Quick sort\n\n```js\nvar quickSort = require('sort-algo').quick;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\nquickSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n","bugs":{"url":"https://github.com/gderouineau/sort-algo/issues"},"dist":{"shasum":"b5bf237e9ac8ecc5014fbd9cff230bfc743f890d","tarball":"https://registry.npmjs.org/sort-algo/-/sort-algo-0.2.3.tgz","integrity":"sha512-o0HRW+NZ0soGQlsWpnkA4ZsKZkPLVFSgCCZStjf/Pg94y3PNhmTOafXHKyTIcLhiaVT7ElvORkN5esKdnibCww==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQDfrkNgAg9PWuvwt7CbglprLunWJyy91qoutQWnJRt5WQIhANE84YZTXcMTwxbtDCkohKNj+2G9pP9DkxNvUvlXy7N/"}]},"_npmVersion":"1.3.11","_npmUser":{"name":"goten","email":"admin@caradoc.fr"},"maintainers":[{"name":"goten","email":"admin@caradoc.fr"}]},"0.2.4":{"name":"sort-algo","description":"sort an array","version":"0.2.4","author":{"name":"guillaume derouineau","email":"guillaume.derouineau@gmail.com"},"dependencies":{},"keywords":["sort","algo","algorithm","insertion"],"main":"index","readmeFilename":"Readme.md","_id":"sort-algo@0.2.4","_from":".","homepage":"http://github.com/gderouineau/sort-algo","repository":{"type":"git","url":"http://github.com/gderouineau/sort-algo.git"},"readme":"\n## Insertion sort\n\nComplexity :  worst : n2 , average n2 , best n where n is the number of elements in the given array\n\nFast algorithm if the array contain a maximum of 15 elements.\n\n```js\nvar insertion = require('sort-algo').insertion;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertion(array, function(err, sortArray){\n    if(err) console.log(err);\n    console.log(sortArray);\n});\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n### Insertion Synchronous sort\n\nSame as insertion sort but the synchronous way\n\n```js\n\nvar insertionSyncSort = require('sort-algo').insertionSync;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertionSyncSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n\n\n## Quick sort\n\nComplexity :  worst : n2 , average n log n , best n log n  where n is the number of elements in the given array\n\ncf : wiki Quick sort\n\n```js\nvar quickSort = require('sort-algo').quick;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\nquickSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n","bugs":{"url":"https://github.com/gderouineau/sort-algo/issues"},"dist":{"shasum":"c16d181d3cd2c57296b77dde74317db22aec4cb5","tarball":"https://registry.npmjs.org/sort-algo/-/sort-algo-0.2.4.tgz","integrity":"sha512-uEKsygEbY0RPnmBudtpkKo1JncYr/9hOKoAACjgngJI26WhAD8u6Om5kg6ohDM3nQYcCPPZc4V5TUWoKO+ppBA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDdylNtmnDO5pKpcT+hv15YyzsZT0L1jKDgOeYBQRWmGgIgQpo+G+ClO/S3IktYujXAp/J5GlhzXXg3cU1O1vnXumI="}]},"_npmVersion":"1.3.11","_npmUser":{"name":"goten","email":"admin@caradoc.fr"},"maintainers":[{"name":"goten","email":"admin@caradoc.fr"}]},"0.2.5":{"name":"sort-algo","description":"sort an array","version":"0.2.5","author":{"name":"guillaume derouineau","email":"guillaume.derouineau@gmail.com"},"dependencies":{},"keywords":["sort","algo","algorithm","insertion"],"main":"index","readmeFilename":"Readme.md","_id":"sort-algo@0.2.5","_from":".","homepage":"http://github.com/gderouineau/sort-algo","repository":{"type":"git","url":"http://github.com/gderouineau/sort-algo.git"},"readme":"\n## Insertion sort\n\nComplexity :  worst : n2 , average n2 , best n where n is the number of elements in the given array\n\nFast algorithm if the array contain a maximum of 15 elements.\n\n```js\nvar insertion = require('sort-algo').insertion;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertion(array, function(err, sortArray){\n    if(err) console.log(err);\n    console.log(sortArray);\n});\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n### Insertion Synchronous sort\n\nSame as insertion sort but the synchronous way\n\n```js\n\nvar insertionSyncSort = require('sort-algo').insertionSync;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertionSyncSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n\n\n## Quick sort\n\nComplexity :  worst : n2 , average n log n , best n log n  where n is the number of elements in the given array\n\ncf : wiki Quick sort\n\n```js\nvar quickSort = require('sort-algo').quick;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\nquickSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n","bugs":{"url":"https://github.com/gderouineau/sort-algo/issues"},"dist":{"shasum":"33fb5d5a6d16c1bc9c176423eac744332cfbd694","tarball":"https://registry.npmjs.org/sort-algo/-/sort-algo-0.2.5.tgz","integrity":"sha512-qsLdK5NFCBWQVbsuO8eGxoKQepMckKwEzZreMM1VbmaH7EAHbk3l1GgYAUUshfH2h3Zdqw+EqfvsRsNFvyexfQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIEanxmLOQon5edbfAZ+xt+YAi2LZ4IlJXj36nxjart7JAiEAwAkIo9i1oxBlFttPUyH/lSu8DD6xMo6VpL9MHyYdhak="}]},"_npmVersion":"1.3.11","_npmUser":{"name":"goten","email":"admin@caradoc.fr"},"maintainers":[{"name":"goten","email":"admin@caradoc.fr"}]},"0.2.6":{"name":"sort-algo","description":"sort an array","version":"0.2.6","author":{"name":"guillaume derouineau","email":"guillaume.derouineau@gmail.com"},"dependencies":{},"keywords":["sort","algo","algorithm","insertion"],"main":"index","readmeFilename":"Readme.md","_id":"sort-algo@0.2.6","_from":".","homepage":"http://github.com/gderouineau/sort-algo","repository":{"type":"git","url":"http://github.com/gderouineau/sort-algo.git"},"readme":"\n## Insertion sort\n\nComplexity :  worst : n2 , average n2 , best n where n is the number of elements in the given array\n\nFast algorithm if the array contain a maximum of 15 elements.\n\n```js\nvar insertion = require('sort-algo').insertion;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertion(array, function(err, sortArray){\n    if(err) console.log(err);\n    console.log(sortArray);\n});\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n### Insertion Synchronous sort\n\nSame as insertion sort but the synchronous way\n\n```js\n\nvar insertionSyncSort = require('sort-algo').insertionSync;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertionSyncSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n\n\n## Quick sort\n\nComplexity :  worst : n2 , average n log n , best n log n  where n is the number of elements in the given array\n\ncf : wiki Quick sort\n\n```js\nvar quickSort = require('sort-algo').quick;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\nquickSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n","bugs":{"url":"https://github.com/gderouineau/sort-algo/issues"},"dist":{"shasum":"1ea9fae621b62df3ec9d29b6e8865ed64ebba1ec","tarball":"https://registry.npmjs.org/sort-algo/-/sort-algo-0.2.6.tgz","integrity":"sha512-pprgenZqmAVYlkhuwdiay1DdTzcJ9sCU/8/KiQUISg29MbWwd3tjzISTSMIKT1VFR+BLND+DmlGKsJQ89+jBuw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEMCH26JvwWTvqu0ZEZgpoDGm09puP+Axwx6jG15DpMp5h8CIGTzBwzahTRXRlpT/+FpvcOEKcvsOVsEOz9lI+l/GQjW"}]},"_npmVersion":"1.3.11","_npmUser":{"name":"goten","email":"admin@caradoc.fr"},"maintainers":[{"name":"goten","email":"admin@caradoc.fr"}]},"0.3.0":{"name":"sort-algo","description":"sort an array","version":"0.3.0","author":{"name":"guillaume derouineau","email":"guillaume.derouineau@gmail.com"},"dependencies":{},"keywords":["sort","algo","algorithm","insertion"],"main":"index","readmeFilename":"Readme.md","_id":"sort-algo@0.3.0","_from":".","homepage":"http://github.com/gderouineau/sort-algo","repository":{"type":"git","url":"http://github.com/gderouineau/sort-algo.git"},"readme":"\n## Insertion sort\n\nComplexity :  worst : n2 , average n2 , best n where n is the number of elements in the given array\n\nFast algorithm if the array contain a maximum of 15 elements.\n\n```js\nvar insertion = require('sort-algo').insertion;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertion(array, function(err, sortArray){\n    if(err) console.log(err);\n    console.log(sortArray);\n});\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n### Insertion Synchronous sort\n\nSame as insertion sort but the synchronous way\n\n```js\n\nvar insertionSyncSort = require('sort-algo').insertionSync;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertionSyncSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n\n\n## Quick sort\n\nComplexity :  worst : n2 , average n log n , best n log n  where n is the number of elements in the given array\n\ncf : wiki Quick sort\n\n```js\nvar quickSort = require('sort-algo').quick;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\nquickSort(array, function(err, result){\n    if(err) console.log(err);\n    console.log(result);\n});\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n### Quick sort Synchronous\n\nSame as quick sort but the synchronous way\n\n```js\n\nvar quickSyncSort = require('sort-algo').quickSync;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\nquickSyncSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```","bugs":{"url":"https://github.com/gderouineau/sort-algo/issues"},"dist":{"shasum":"dfd6c6ff9d296a4a8341dd3a0b13f38890bdca89","tarball":"https://registry.npmjs.org/sort-algo/-/sort-algo-0.3.0.tgz","integrity":"sha512-cEEfgQpbl79mp52WwOraJVMhEQcgsvVQFEnyK+RJjleCejmXxX/doNkp84URZJYnqnbDHnjdjWwgMuqrRlJPmg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCH3Ljg6wpxwvsLYkXs2aegkUjmTBuVJ2G1q1KUkkfC0sCIQDLjJkH8P2wKmTPqKwQeT0V6CWdhoNvsiW2SIlj2urblQ=="}]},"_npmVersion":"1.3.11","_npmUser":{"name":"goten","email":"admin@caradoc.fr"},"maintainers":[{"name":"goten","email":"admin@caradoc.fr"}]}},"readme":"\n## Insertion sort\n\nComplexity :  worst : n2 , average n2 , best n where n is the number of elements in the given array\n\nFast algorithm if the array contain a maximum of 15 elements.\n\n```js\nvar insertion = require('sort-algo').insertion;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\ninsertion(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n\n\n\n## Quick sort\n\nComplexity :  worst : n2 , average n log n , best n log n  where n is the number of elements in the given array\n\ncf : wiki Quick sort\n\n```js\nvar quickSort = require('sort-algo').quick;\n\nvar array  = [ 4 , 6 , 3 , 7 , 1 , 9 , 2 ] ;\n\nquickSort(array);\n// return [ 1 , 2 , 3 , 4 , 6 , 7 , 9 ]\n\n```\n","maintainers":[{"name":"goten","email":"admin@caradoc.fr"}],"time":{"modified":"2022-06-26T22:15:44.998Z","created":"2013-10-31T13:01:12.942Z","0.1.0":"2013-10-31T13:01:16.142Z","0.1.1":"2013-11-06T14:26:08.417Z","0.1.2":"2013-11-06T14:46:16.864Z","0.2.0":"2013-11-13T10:31:30.235Z","0.2.1":"2013-11-13T10:35:37.668Z","0.2.2":"2013-11-13T10:51:37.222Z","0.2.3":"2013-11-13T10:54:43.696Z","0.2.4":"2013-11-13T10:56:45.626Z","0.2.5":"2013-11-13T11:00:11.097Z","0.2.6":"2013-11-13T11:01:03.458Z","0.3.0":"2013-11-13T11:04:22.621Z"},"author":{"name":"guillaume derouineau","email":"guillaume.derouineau@gmail.com"},"repository":{"type":"git","url":"http://github.com/gderouineau/sort-algo.git"}}