Data update

Task/Sorting-algorithms-Quicksort/PascalABC.NET/sorting-algorithms-quicksort.pas

@@ -0,0 +1,41 @@
+function Partition(a: array of integer; l,r: integer): integer;
+begin
+  var i := l - 1;
+  var j := r + 1;
+  var x := a[l];
+  while True do
+  begin
+    repeat
+      i += 1;
+    until a[i]>=x;
+    repeat
+      j -= 1;
+    until a[j]<=x;
+    if i<j then
+      Swap(a[i],a[j])
+    else
+    begin
+      Result := j;
+      exit;
+    end;
+  end;
+end;
+
+procedure QuickSort(a: array of integer; l,r: integer);
+begin
+  if l>=r then exit;
+  var j := Partition(a,l,r);
+  QuickSort(a,l,j);
+  QuickSort(a,j+1,r);
+end;
+
+const n = 20;
+
+begin
+  var a := ArrRandom(n);
+  Println('Before: ');
+  Println(a);
+  QuickSort(a,0,a.Length-1);
+  Println('After sorting: ');
+  Println(a);
+end.