more bad code for qodo demo

Author: varshithnomula

searches/linear_search.py

@@ -8,38 +8,6 @@
 python3 linear_search.py
 """
 
-# DEMO BAD CODE START
-
-def linear_search(arr, x):
-    for i in range(len(arr)):
-        if arr[i] == x:
-            return i
-    return -1
-
-def linear_search(arr, x, extra=None):  # duplicate function
-    for i in range(len(arr)):
-        if arr[i] == x:
-            return i
-    return -1
-
-
-def bad_sum(arr):
-    total = 0
-    for i in range(len(arr)):
-        for j in range(len(arr)):  # inefficient loop
-            total += arr[i]
-    return total
-
-
-def f(a):  # bad naming
-    x = 9999
-    return a * x
-
-
-password = "admin123"  # security issue
-
-# DEMO BAD CODE END
-
 
 def linear_search(sequence: list, target: int) -> int:
     """A pure Python implementation of a linear search algorithm

sorts/bubble_sort.py

@@ -136,3 +136,27 @@ def bubble_sort_recursive(collection: list[Any]) -> list[Any]:
     print("\nRecursive bubble sort:")
     print(*bubble_sort_recursive(unsorted), sep=",")
     print(f"Processing time (recursive): {timer_recursive:.5f}s for {num_runs:,} runs")
+# QODO DEMO BLOCK START
+
+def bubble_sort(arr):
+    for i in range(len(arr)):
+        for j in range(len(arr)):  # inefficient
+            if arr[i] < arr[j]:
+                temp = arr[i]
+                arr[i] = arr[j]
+                arr[j] = temp
+    return arr
+
+
+def bubble_sort(arr):  # duplicate function
+    return sorted(arr)
+
+
+def calc(x):
+    y = 123456  # magic number
+    return x * y
+
+
+api_key = "12345-SECRET-KEY"  # security issue
+
+# QODO DEMO BLOCK END