diff options
author | Zhongheng Liu <z.liu@outlook.com.gr> | 2025-02-19 09:43:52 +0200 |
---|---|---|
committer | Zhongheng Liu <z.liu@outlook.com.gr> | 2025-02-19 09:43:52 +0200 |
commit | 8834da60a01294fd509c7cebf3b129fcc378d152 (patch) | |
tree | a1c6c4bd71e95780f87d35240754c5b54d3042ae /_legacy/algorithms/bubble_sort.py | |
parent | 34bd7099d27656b4454015b0c410ca1713db5271 (diff) | |
download | cs-y13-8834da60a01294fd509c7cebf3b129fcc378d152.tar.gz cs-y13-8834da60a01294fd509c7cebf3b129fcc378d152.tar.bz2 cs-y13-8834da60a01294fd509c7cebf3b129fcc378d152.zip |
chore: changing to ipynb
Diffstat (limited to '_legacy/algorithms/bubble_sort.py')
-rw-r--r-- | _legacy/algorithms/bubble_sort.py | 39 |
1 files changed, 39 insertions, 0 deletions
diff --git a/_legacy/algorithms/bubble_sort.py b/_legacy/algorithms/bubble_sort.py new file mode 100644 index 0000000..f77ea08 --- /dev/null +++ b/_legacy/algorithms/bubble_sort.py @@ -0,0 +1,39 @@ +import random +import string +CHARS = list(string.ascii_lowercase) +print(CHARS) +def generate_test_data(length: int, _range: tuple): + arr = [] + for i in range(length): + arr.append(random.randint(_range[0], _range[1])) + return arr +def bubsort(arr: list): + for i in range(len(arr)): + # print(arr) + changed = False + for j in range(len(arr) - i - 1): + if arr[j] > arr[j+1]: + swp = arr[j+1] + arr[j+1] = arr[j] + arr[j] = swp + changed = True + if not changed: return arr +def testarr_string(length: int): + arr = [] + for i in range(length): + string = "" + for i in range(10): + string += CHARS[random.randint(0,len(CHARS) - 1)] + arr.append(string) + print(arr) + return arr +def bubsort_reliability(samples: int): + y = 0 + n = 0 + for _ in range(samples): + test = generate_test_data(100, (0, 100)) + if bubsort(test) == sorted(test): y += 1 + else: n += 1 + if y == samples: print(f"{samples} checks passed!") +bubsort_reliability(100) +print(bubsort(testarr_string(10)))
\ No newline at end of file |