diff --git a/Algorithms/Java/BurbleSort.java b/Algorithms/Java/BurbleSort.java
new file mode 100644
index 0000000..357c769
--- /dev/null
+++ b/Algorithms/Java/BurbleSort.java
@@ -0,0 +1,31 @@
+public class BubbleSort {
+    public static void main(String[] args) {
+        int[] arr = {64, 34, 25, 12, 22, 11, 90};
+
+        bubbleSort(arr);
+
+        System.out.println("Sorted array:");
+        for (int i = 0; i < arr.length; i++) {
+            System.out.print(arr[i] + " ");
+        }
+    }
+
+    static void bubbleSort(int arr[]) {
+        int n = arr.length;
+        boolean swapped;
+        for (int i = 0; i < n - 1; i++) {
+            swapped = false;
+            for (int j = 0; j < n - i - 1; j++) {
+                if (arr[j] > arr[j + 1]) {
+                    int temp = arr[j];
+                    arr[j] = arr[j + 1];
+                    arr[j + 1] = temp;
+                    swapped = true;
+                }
+            }
+            if (!swapped) {
+                break;
+            }
+        }
+    }
+}
diff --git a/Algorithms/Java/test b/Algorithms/Java/test
deleted file mode 100644
index 8b13789..0000000
--- a/Algorithms/Java/test
+++ /dev/null
@@ -1 +0,0 @@
-
diff --git a/Algorithms/Python/BubbleSort.py b/Algorithms/Python/BubbleSort.py
new file mode 100644
index 0000000..9d4fcbd
--- /dev/null
+++ b/Algorithms/Python/BubbleSort.py
@@ -0,0 +1,16 @@
+def burble_sort(arr):
+    n = len(arr)
+
+    for i in range(n):
+        swapped = False
+
+        for j in range(0, n - i - 1):
+            if arr[j] > arr[j + 1]:
+                arr[j], arr[j + 1] = arr[j + 1], arr[j]  # Swap elements
+                swapped = True
+        if not swapped:
+            break
+arr = [64, 34, 25, 12, 22, 11, 90]
+bubble_sort(arr)
+print("Sorted array:")
+print(arr)
diff --git a/Algorithms/Python/test b/Algorithms/Python/test
deleted file mode 100644
index 8b13789..0000000
--- a/Algorithms/Python/test
+++ /dev/null
@@ -1 +0,0 @@
-