--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/bubblesort/bubblesort-recursive.py	Thu Sep 21 22:32:14 2023 +0200
@@ -0,0 +1,23 @@
+#!/usr/bin/env python3
+
+tab = [3, 10, 1, 4, 5, 9, 8, 20, 11, 15, 12, 17, 18]
+
+def func1(i):
+	if i == 0:
+		return
+	else:
+		func2(len(tab) - i - 1)
+		#print("i: "+str(i))
+		func1(i - 1)
+		
+def func2(j):
+	if j < 0:
+		return
+	else:
+		if (tab[j] > tab[j + 1]):
+			tab[j], tab[j+ 1] = tab[j + 1], tab[j]
+		#print ("j:"+str(j))
+		func2(j - 1)
+		
+func1(len(tab))
+print(tab)