Lua 1.11.1

1 files changed, 51 insertions, 0 deletions

diff --git a/test/sort/q.lua b/test/sort/q.lua
new file mode 100644
index 00000000..8d9a20d4
--- /dev/null
+++ b/test/sort/q.lua
@@ -0,0 +1,51 @@
+function quicksort(r,s)
+	if s<=r then return end		-- caso basico da recursao
+	local v=x[r]
+	local i=r
+	local j=s+1
+	repeat
+		repeat i=i+1 until x[i]>=v
+		repeat j=j-1 until x[j]<=v
+		x[i],x[j]=x[j],x[i]
+	until j<=i			-- separacao
+	x[i],x[j]=x[j],x[i]		-- undo last swap
+	x[j],x[r]=x[r],x[j]
+	quicksort(r,j-1)		-- recursao
+	quicksort(j+1,s)
+end
+
+function main()
+ x=@()
+ n=-1
+ n=n+1;	x[n]="a"
+ n=n+1;	x[n]="waldemar"
+ n=n+1;	x[n]="luiz"
+ n=n+1;	x[n]="lula"
+ n=n+1;	x[n]="peter"
+ n=n+1;	x[n]="raquel"
+ n=n+1;	x[n]="camilo"
+ n=n+1;	x[n]="andre"
+ n=n+1;	x[n]="marcelo"
+ n=n+1;	x[n]="sedrez"
+ n=n+1;	x[n]="z"
+-- sort(x,n)
+ quicksort(1,n-1)
+print(x[0]..","..x[1]..","..x[2]..","..x[3]..","..x[4]..","..x[5]..","..x[6]..","..x[7]..","..x[8]..","..x[9]..","..x[10])
+end
+
+function sort(a,n)			-- selection sort
+ local i=1
+ while i<=n do
+  local m=i
+  local j=i+1
+  while j<=n do
+   if a[j]<a[m] then m=j end
+   j=j+1
+  end
+ a[i],a[m]=a[m],a[i]			-- swap a[i] and a[m]
+ print (i, a[i])
+ i=i+1
+ end
+end
+
+main()