Initial data commit

Task/Sorting-algorithms-Quicksort/Mond/sorting-algorithms-quicksort-1.mond

@@ -0,0 +1,32 @@
+fun quicksort( arr, cmp )
+{
+    if( arr.length() < 2 )
+        return arr;
+
+    if( !cmp )
+        cmp = ( a, b ) -> a - b;
+
+    var a = [ ], b = [ ];
+    var pivot = arr[0];
+    var len = arr.length();
+
+    for( var i = 1; i < len; ++i )
+    {
+        var item = arr[i];
+
+        if( cmp( item, pivot ) < cmp( pivot, item ) )
+            a.add( item );
+        else
+            b.add( item );
+    }
+
+    a = quicksort( a, cmp );
+    b = quicksort( b, cmp );
+
+    a.add( pivot );
+
+    foreach( var item in b )
+        a.add( item );
+
+    return a;
+}

Task/Sorting-algorithms-Quicksort/Mond/sorting-algorithms-quicksort-2.mond

@@ -0,0 +1,4 @@
+var array = [ 532, 16, 153, 3, 63.60, 925, 0.214 ];
+var sorted = quicksort( array );
+
+printLn( sorted );