commit

Author: diwakar1593

bubblesort.java

@@ -1,35 +1,27 @@
-public class BubbleSortExample {  
-    static void bubbleSort(int[] arr) {  
-        int n = arr.length;  
-        int temp = 0;  
-         for(int i=0; i < n; i++){  
-                 for(int j=1; j < (n-i); j++){  
-                          if(arr[j-1] > arr[j]){  
-                                 //swap elements  
-                                 temp = arr[j-1];  
-                                 arr[j-1] = arr[j];  
-                                 arr[j] = temp;  
-                         }  
-                          
-                 }  
-         }  
-  
-    }  
-    public static void main(String[] args) {  
-                int arr[] ={3,60,35,2,45,320,5};  
-                 
-                System.out.println("Array Before Bubble Sort");  
-                for(int i=0; i < arr.length; i++){  
-                        System.out.print(arr[i] + " ");  
-                }  
-                System.out.println();  
-                  
-                bubbleSort(arr);//sorting array elements using bubble sort  
-                 
-                System.out.println("Array After Bubble Sort");  
-                for(int i=0; i < arr.length; i++){  
-                        System.out.print(arr[i] + " ");  
-                }  
-   
-        }  
-}  
+import java.util.Scanner;
+public class BubbleSort {
+    public static void main(String[] args){
+        Scanner sc = new Scanner(System.in);
+        System.out.println("Enter the  number of elements");
+        int n = sc.nextInt();
+        
+        int[] arr = new int[n];
+        System.out.println("Enter the elements");
+        for(int i = 0 ; i<n;i++){
+            arr[i]=sc.nextInt();
+        }
+            for(int i = 0 ; i<n;i++){
+                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;
+                    }
+                }
+            }
+            System.out.println("sorted array is ");
+            for(int i = 0;i<n;i++){
+                System.out.println(arr[i]+" ");
+            }
+    }}     
+       

heapsort.java

@@ -1,71 +1,72 @@
-// Java program for implementation of Heap Sort
+import java.util.*;
 public class HeapSort {
-	public void sort(int arr[])
-	{
-		int n = arr.length;
-
-		// Build heap (rearrange array)
-		for (int i = n / 2 - 1; i >= 0; i--)
-			heapify(arr, n, i);
-
-		// One by one extract an element from heap
-		for (int i = n - 1; i >= 0; i--) {
-			// Move current root to end
-			int temp = arr[0];
-			arr[0] = arr[i];
-			arr[i] = temp;
-
-			// call max heapify on the reduced heap
-			heapify(arr, i, 0);
+		public void sort(int arr[])
+		{
+			int N = arr.length;
+
+			for (int i = N / 2 - 1; i >= 0; i--)
+				heapify(arr, N, i);
+
+			for (int i = N - 1; i > 0; i--) {
+
+				int x = arr[0];
+				arr[0] = arr[i];
+				arr[i] = x;
+
+				heapify(arr, i, 0);
+			}
+		}
+
+		void heapify(int arr[], int N, int i)
+		{
+			int largest = i; 
+			int l = 2 * i + 1; 
+			int r = 2 * i + 2; 
+
+			if (l < N && arr[l] > arr[largest])
+				largest = l;
+
+			if (r < N && arr[r] > arr[largest])
+				largest = r;
+
+			if (largest != i) {
+				int swap = arr[i];
+				arr[i] = arr[largest];
+				arr[largest] = swap;
+
+				heapify(arr, N, largest);
+			}
 		}
-	}
-
-	// To heapify a subtree rooted with node i which is
-	// an index in arr[]. n is size of heap
-	void heapify(int arr[], int n, int i)
-	{
-		int largest = i; // Initialize largest as root
-		int l = 2 * i + 1; // left = 2*i + 1
-		int r = 2 * i + 2; // right = 2*i + 2
-
-		// If left child is larger than root
-		if (l < n && arr[l] > arr[largest])
-			largest = l;
-
-		// If right child is larger than largest so far
-		if (r < n && arr[r] > arr[largest])
-			largest = r;
-
-		// If largest is not root
-		if (largest != i) {
-			int swap = arr[i];
-			arr[i] = arr[largest];
-			arr[largest] = swap;
-
-			// Recursively heapify the affected sub-tree
-			heapify(arr, n, largest);
+		static void printArray(int arr[])
+		{
+			int N = arr.length;
+
+			for (int i = 0; i < N; ++i)
+				System.out.print(arr[i] + " ");
+			System.out.println();
+		}
+
+		public static void main(String args[])
+		{
+			 int i, n, arr[];
+
+		      Scanner s = new Scanner(System.in);
+		      System.out.println("Enter no. of elements in aray:");
+		      n = s.nextInt(); 
+
+		      arr = new int[n];
+
+		      System.out.println("Enter " + n + " integers:");
+
+		      for (i = 0;i<n; i++)
+		          arr[i] = s.nextInt();
+
+			HeapSort ob = new HeapSort();
+			ob.sort(arr);
+
+			System.out.println("Sorted array is");
+			printArray(arr);
 		}
-	}
-
-	/* A utility function to print array of size n */
-	static void printArray(int arr[])
-	{
-		int n = arr.length;
-		for (int i = 0; i < n; ++i)
-			System.out.print(arr[i] + " ");
-		System.out.println();
-	}
-
-	// Driver program
-	public static void main(String args[])
-	{
-		int arr[] = { 12, 11, 13, 5, 6, 7 };
-		int n = arr.length;
-
-		HeapSort ob = new HeapSort();
-		ob.sort(arr);
-
-		System.out.println("Sorted array is");
-		printArray(arr);
-	}
+	
+
 }