all tasks

Task/Sorting-algorithms-Quicksort/Octave/sorting-algorithms-quicksort.octave

@@ -0,0 +1,12 @@
+function f=quicksort(v)                       % v must be a column vector
+  f = v; n=length(v);
+  if(n > 1)
+     vl = min(f); vh = max(f);                  % min, max
+     p  = (vl+vh)*0.5;                          % pivot
+     ia = find(f < p); ib = find(f == p); ic=find(f > p);
+     f  = [quicksort(f(ia)); f(ib); quicksort(f(ic))];
+  end
+endfunction
+
+N=30; v=rand(N,1); tic,u=quicksort(v); toc
+u