[javascript]
\nArray.prototype.swap=function(a, b)
\n{
\n var tmp=this[a];
\n this[a]=this[b];
\n this[b]=tmp;
\n}<\/p>\n
function quickSort(array,comparator) {
\n qsort(array,0,array.length,comparator);
\n}<\/p>\n
\/**
\n * NOTE: the comparator is a dynamic function you will define
\n like so comparator(a,b) {
\n if (a > b) return 1;
\n else if (a < b) return -1;
\n else {
\n return 0;
\n }
\n }
\n * it is up to you to determine the comparison logic between the elements.
\n * it’s particularly useful if you’re comparing objects and different properties
\n * inside them.
\n *\/
\nfunction qsort(array, begin, end, comparator)
\n{
\n if(end-1>begin) {
\n\tvar pivot=begin+Math.floor(Math.random()*(end-begin));<\/p>\n
\tpivot=partition(array, begin, end, pivot, comparator);<\/p>\n
\tqsort(array, begin, pivot, comparator);
\n\tqsort(array, pivot+1, end, comparator);
\n }
\n}<\/p>\n
function partition(array, begin, end, pivot, comparator) {
\n var piv=array[pivot];
\n array.swap(pivot, end-1);
\n var store=begin;
\n var ix;
\n for(ix=begin; ix<end-1; ++ix) {
\n if (piv!=undefined && comparator(piv, array[ix]) < 0) {
\n\t array.swap(store, ix);
\n\t ++store;
\n\t}
\n }
\n array.swap(end-1, store);<\/p>\n
return store;
\n}
\n[\/javascript]<\/p>\n","protected":false},"excerpt":{"rendered":"
[javascript] Array.prototype.swap=function(a, b) { var tmp=this[a]; this[a]=this[b]; this[b]=tmp; } function quickSort(array,comparator) { qsort(array,0,array.length,comparator); } \/** * NOTE: the comparator is a dynamic function you will define like so comparator(a,b) { if (a > b) return 1; else if (a < b) return -1; else { return 0; } } * it is up to you […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_feature_clip_id":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2},"jetpack_post_was_ever_published":false},"categories":[15],"tags":[],"class_list":["post-3","post","type-post","status-publish","format-standard","hentry","category-code"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p5Unzf-3","jetpack-related-posts":[{"id":520,"url":"https:\/\/www.gubatron.com\/blog\/recordando-algoritmos-quicksort\/","url_meta":{"origin":3,"position":0},"title":"Recordando algoritmos, Quicksort","author":"gubatron","date":"May 17, 2007","format":false,"excerpt":"Leyendo no se que en internet, lei mencionar algo sobre preguntas de entrevistas de trabajo, y mencionaron que siempre es bueno saber como funciona Quicksort. Por algun motivo, el algoritmo de ordenamiento que siempre recuerdo es Bubble sort, pero todos sabemos que no es el mejor. So decidi repasar y\u2026","rel":"","context":"In "Code"","block_context":{"text":"Code","link":"https:\/\/www.gubatron.com\/blog\/category\/code\/"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":2121,"url":"https:\/\/www.gubatron.com\/blog\/playing-with-basics-of-html5-canvas\/","url_meta":{"origin":3,"position":1},"title":"Playing with basics of HTML5 Canvas","author":"gubatron","date":"December 18, 2010","format":false,"excerpt":"Here's a snippet of something I did tonight to play a bit with the Canvas and 2d Graphics context objects in javascript. [html]