Kapoor-0905 · Kapoor-0905 · Oct 10, 2022 · Oct 10, 2022
diff --git a/C Plus Plus/Data Structure/Arrays/Array.cpp → C++/Array.cpp b/C Plus Plus/Data Structure/Arrays/Array.cpp → C++/Array.cpp
diff --git a/...cture/Arrays/Maximum_element_in_Array.cpp → C++/Maximum_element_in_Array.cpp b/...cture/Arrays/Maximum_element_in_Array.cpp → C++/Maximum_element_in_Array.cpp
diff --git a/Java Codes/JosephusProblem.java b/Java Codes/JosephusProblem.java
diff --git a/Java Codes/BreadthFirstSearch.java → Java/BreadthFirstSearch.java b/Java Codes/BreadthFirstSearch.java → Java/BreadthFirstSearch.java
diff --git a/Sorting_Algorithms/BubbleSort.java → Java/BubbleSort.java b/Sorting_Algorithms/BubbleSort.java → Java/BubbleSort.java
diff --git a/Java Codes/DepthFirstSearch.java → Java/DepthFirstSearch.java b/Java Codes/DepthFirstSearch.java → Java/DepthFirstSearch.java
diff --git a/Java Codes/HeapSort.java → Java/HeapSort.java b/Java Codes/HeapSort.java → Java/HeapSort.java
diff --git a/Java Codes/Insertion.java → Java/Insertion.java b/Java Codes/Insertion.java → Java/Insertion.java
diff --git a/Sorting_Algorithms/MergeSort.java → Java/MergeSort.java b/Sorting_Algorithms/MergeSort.java → Java/MergeSort.java
diff --git a/Sorting_Algorithms/QuickSort.java → Java/QuickSort.java b/Sorting_Algorithms/QuickSort.java → Java/QuickSort.java
diff --git a/Sorting_Algorithms/SelectionSort.java → Java/SelectionSort.java b/Sorting_Algorithms/SelectionSort.java → Java/SelectionSort.java
diff --git a/Java Codes/SudokuSolver.java → Java/SudokuSolver.java b/Java Codes/SudokuSolver.java → Java/SudokuSolver.java
diff --git a/Java Codes/_1ErrorAndException.java → Java/_1ErrorAndException.java b/Java Codes/_1ErrorAndException.java → Java/_1ErrorAndException.java
@@ -1,50 +1,50 @@
-package _14ErrorAndException;
-
-import java.util.Scanner;
-
-public class _1ErrorAndException {
-    public static void main(String[] args) {
-        /*
-            There are 3 type of error
-            1. Syntax error
-            2. Logical error
-            3. Runtime error
-        */
-
-        // 1. Synatx error
-        /*
-        try {
-            a = 10;
-            int b = 4
-            System.out.println(a+d);
-
-        } catch (Exception e) {
-            System.out.println(e);
-        }
-        */
-
-
-        // 2.Logical error
-        /*write a program to print all prime number between 1 and 10 but 9 is not prime,
-        that means we implement wrong logic */
-
-        /*
-        System.out.println(2);
-        for (int i = 1; i < 5; i++) {
-            System.out.println(2 * i + 1);
-        }
-       */
-
-        // 3. Runtime Error---> Exception error
-        /* here a variable is must integer, if is not int then we will get runtime error
-            so this type of error we can handle using try, catch and finally block
-        */
-        System.out.print("Enter the number: ");
-        Scanner sc = new Scanner(System.in);
-        int a = sc.nextInt();
-
-        System.out.println("Calculation is " + 1000 / a);
-
-
-    }
-}
+package _14ErrorAndException;
+
+import java.util.Scanner;
+
+public class _1ErrorAndException {
+    public static void main(String[] args) {
+        /*
+            There are 3 type of error
+            1. Syntax error
+            2. Logical error
+            3. Runtime error
+        */
+
+        // 1. Synatx error
+        /*
+        try {
+            a = 10;
+            int b = 4
+            System.out.println(a+d);
+
+        } catch (Exception e) {
+            System.out.println(e);
+        }
+        */
+
+
+        // 2.Logical error
+        /*write a program to print all prime number between 1 and 10 but 9 is not prime,
+        that means we implement wrong logic */
+
+        /*
+        System.out.println(2);
+        for (int i = 1; i < 5; i++) {
+            System.out.println(2 * i + 1);
+        }
+       */
+
+        // 3. Runtime Error---> Exception error
+        /* here a variable is must integer, if is not int then we will get runtime error
+            so this type of error we can handle using try, catch and finally block
+        */
+        System.out.print("Enter the number: ");
+        Scanner sc = new Scanner(System.in);
+        int a = sc.nextInt();
+
+        System.out.println("Calculation is " + 1000 / a);
+
+
+    }
+}
diff --git a/Sorting_Algorithms/insertion_sort.java → Java/insertion_sort.java b/Sorting_Algorithms/insertion_sort.java → Java/insertion_sort.java
diff --git a/Java Codes/josephusproblem.java → Java/josephusproblem.java b/Java Codes/josephusproblem.java → Java/josephusproblem.java
diff --git a/Bill Management System in Python/app.py → ...s/Bill Management System in Python/app.py b/Bill Management System in Python/app.py → ...s/Bill Management System in Python/app.py
diff --git a/calculator/calculator.py → ...and Applications/Calculator/calculator.py b/calculator/calculator.py → ...and Applications/Calculator/calculator.py
diff --git a/QUIZ PROJECT/index.py → ... Applications/Quiz App in Python/index.py b/QUIZ PROJECT/index.py → ... Applications/Quiz App in Python/index.py
diff --git a/Python codes/BankingSystem.py → Python/BankingSystem.py b/Python codes/BankingSystem.py → Python/BankingSystem.py
diff --git a/BubbleSort.py → Python/BubbleSort.py b/BubbleSort.py → Python/BubbleSort.py
@@ -1,27 +1,27 @@
-# Bubble sort in Python
-
-def bubbleSort(array):
-    
-  # loop to access each array element
-  for i in range(len(array)):
-
-    # loop to compare array elements
-    for j in range(0, len(array) - i - 1):
-
-      # compare two adjacent elements
-      # change > to < to sort in descending order
-      if array[j] > array[j + 1]:
-
-        # swapping elements if elements
-        # are not in the intended order
-        temp = array[j]
-        array[j] = array[j+1]
-        array[j+1] = temp
-
-
-data = [-2, 45, 0, 11, -9]
-
-bubbleSort(data)
-
-print('Sorted Array in Ascending Order:')
+# Bubble sort in Python
+
+def bubbleSort(array):
+
+  # loop to access each array element
+  for i in range(len(array)):
+
+    # loop to compare array elements
+    for j in range(0, len(array) - i - 1):
+
+      # compare two adjacent elements
+      # change > to < to sort in descending order
+      if array[j] > array[j + 1]:
+
+        # swapping elements if elements
+        # are not in the intended order
+        temp = array[j]
+        array[j] = array[j+1]
+        array[j+1] = temp
+
+
+data = [-2, 45, 0, 11, -9]
+
+bubbleSort(data)
+
+print('Sorted Array in Ascending Order:')
 print(data)
diff --git a/...n codes/Sorting_Algorithms/Bubble_sort.py → Python/Bubble_sort.py b/...n codes/Sorting_Algorithms/Bubble_sort.py → Python/Bubble_sort.py
diff --git a/Python codes/GuessTheNumber.py → Python/GuessTheNumber.py b/Python codes/GuessTheNumber.py → Python/GuessTheNumber.py
diff --git a/Python codes/HanoiTower.py → Python/HanoiTower.py b/Python codes/HanoiTower.py → Python/HanoiTower.py
diff --git a/Python codes/InsertionSort.py → Python/InsertionSort.py b/Python codes/InsertionSort.py → Python/InsertionSort.py
diff --git a/...on codes/Sorting_Algorithms/Merge_sort.py → Python/Merge_sort.py b/...on codes/Sorting_Algorithms/Merge_sort.py → Python/Merge_sort.py
diff --git a/Python codes/Reverse Stack.py → Python/Reverse Stack.py b/Python codes/Reverse Stack.py → Python/Reverse Stack.py
diff --git a/...odes/Sorting_Algorithms/Selection_sort.py → Python/Selection_sort.py b/...odes/Sorting_Algorithms/Selection_sort.py → Python/Selection_sort.py
diff --git a/Python codes/Student Grading System.py → Python/Student Grading System.py b/Python codes/Student Grading System.py → Python/Student Grading System.py
diff --git a/Python codes/Tic_Tac_toe.py → Python/Tic_Tac_toe.py b/Python codes/Tic_Tac_toe.py → Python/Tic_Tac_toe.py
diff --git a/Python codes/Tower of Hanoi.py → Python/Tower of Hanoi.py b/Python codes/Tower of Hanoi.py → Python/Tower of Hanoi.py
diff --git a/Python codes/Two Sum.py → Python/Two Sum.py b/Python codes/Two Sum.py → Python/Two Sum.py
diff --git a/Python codes/WhatsappCricketScore.py → Python/WhatsappCricketScore.py b/Python codes/WhatsappCricketScore.py → Python/WhatsappCricketScore.py
diff --git a/Python codes/armstrong_number.py → Python/armstrong_number.py b/Python codes/armstrong_number.py → Python/armstrong_number.py
diff --git a/Python codes/calculator.py → Python/calculator.py b/Python codes/calculator.py → Python/calculator.py
diff --git a/Python codes/genetic_algorithm.py → Python/genetic_algorithm.py b/Python codes/genetic_algorithm.py → Python/genetic_algorithm.py
diff --git a/Python codes/lottery_system_game.py → Python/lottery_system_game.py b/Python codes/lottery_system_game.py → Python/lottery_system_game.py
diff --git a/Python codes/lowest_Sum.py → Python/lowest_Sum.py b/Python codes/lowest_Sum.py → Python/lowest_Sum.py
diff --git a/Python codes/pangram_check.py → Python/pangram_check.py b/Python codes/pangram_check.py → Python/pangram_check.py
diff --git a/Python codes/pattern.py → Python/pattern.py b/Python codes/pattern.py → Python/pattern.py
diff --git a/Python codes/prime.py → Python/prime.py b/Python codes/prime.py → Python/prime.py
diff --git a/Python codes/prims.py → Python/prims.py b/Python codes/prims.py → Python/prims.py
diff --git a/Python codes/roman_number.py → Python/roman_number.py b/Python codes/roman_number.py → Python/roman_number.py
diff --git a/Python codes/star.py → Python/star.py b/Python codes/star.py → Python/star.py
diff --git a/Sorting_Algorithms/Bubble_sort.py b/Sorting_Algorithms/Bubble_sort.py
diff --git a/Sorting_Algorithms/Merge_sort.py b/Sorting_Algorithms/Merge_sort.py
diff --git a/Sorting_Algorithms/Selection_sort.py b/Sorting_Algorithms/Selection_sort.py
diff --git a/binary_search/binary_search.cpp b/binary_search/binary_search.cpp