Initial data commit

Task/Sorting-algorithms-Quicksort/Run-BASIC/sorting-algorithms-quicksort.basic

@@ -0,0 +1,45 @@
+' -------------------------------
+' quick sort
+' -------------------------------
+size = 50
+dim s(size)			' array to sort
+for i = 1 to size		' fill it with some random numbers
+ s(i) = rnd(0) * 100
+next i
+
+lft  = 1
+rht  = size
+
+[qSort]
+  lftHold = lft
+  rhtHold = rht
+  pivot   = s(lft)
+  while lft < rht
+    while (s(rht) >= pivot) and (lft < rht) : rht = rht - 1 :wend
+    if lft <> rht then
+      s(lft) = s(rht)
+      lft    = lft + 1
+    end if
+    while (s(lft) <= pivot) and (lft < rht) : lft = lft + 1 :wend
+    if lft <> rht then
+      s(rht) = s(lft)
+      rht    = rht - 1
+    end if
+  wend
+
+  s(lft) = pivot
+  pivot  = lft
+  lft    = lftHold
+  rht    = rhtHold
+  if lft < pivot then
+    rht = pivot - 1
+    goto [qSort]
+  end if
+ if rht > pivot then
+    lft = pivot + 1
+    goto [qSort]
+ end if
+
+for i = 1 to size
+ print i;"-->";s(i)
+next i