rename solved

Author: 5ar5kovic

Sorting/Bubble Sort/Brainfuck/Bubble_Sort.bf

@@ -0,0 +1,8 @@
+>>,[>>,]<<[
+[<<]>>>>[
+<<[>+<<+>-]
+>>[>+<<<<[->]>[<]>>-]
+<<<[[-]>>[>+<-]>>[<<<+>>>-]]
+>>[[<+>-]>>]<
+]<<[>>+<<-]<<
+]>>>>[.>>]

Sorting/Bubble Sort/C++/Bubble_Sort_1.cpp

@@ -0,0 +1,41 @@
+// C program for implementation of Bubble sort 
+#include <stdio.h> 
+  
+void swap(int *xp, int *yp) 
+{ 
+    int temp = *xp; 
+    *xp = *yp; 
+    *yp = temp; 
+} 
+  
+// A function to implement bubble sort 
+void bubbleSort(int arr[], int n) 
+{ 
+   int i, j; 
+   for (i = 0; i < n-1; i++)       
+  
+       // Last i elements are already in place    
+       for (j = 0; j < n-i-1; j++)  
+           if (arr[j] > arr[j+1]) 
+              swap(&arr[j], &arr[j+1]); 
+} 
+  
+/* Function to print an array */
+void printArray(int arr[], int size) 
+{ 
+    int i; 
+    for (i=0; i < size; i++) 
+        printf("%d ", arr[i]); 
+    printf("n"); 
+} 
+  
+// Driver program to test above functions 
+int main() 
+{ 
+    int arr[] = {64, 34, 25, 12, 22, 11, 90}; 
+    int n = sizeof(arr)/sizeof(arr[0]); 
+    bubbleSort(arr, n); 
+    printf("Sorted array: \n"); 
+    printArray(arr, n); 
+    return 0; 
+} 

Sorting/Bubble Sort/C++/Bubble_Sort_2.cpp

@@ -0,0 +1,41 @@
+#include <iostream>
+using namespace std;
+
+void bubbleSort(int A[],int n)
+{
+	int i,j;
+	int temp;
+	for(i=0;i<n;i++)
+	{
+		for(j=0;j<n-i;j++)
+		{
+			if(A[j]>A[j+1])
+			{
+				temp=A[j];
+				A[j]=A[j+1];
+				A[j+1]=temp;
+			}
+		}
+	}
+}
+
+int main()
+{
+	int n;
+	cout<<"Enter the size of the array\n";
+	cin>>n;
+	int a[n];
+	cout<<"Enter the element\n";
+	for(int i=0;i<n;i++)
+	{
+		cin>>a[i];
+	}
+	bubbleSort(a,n);
+	cout<<"The Sorted array is :-";
+	for(int i=0;i<n;i++)
+	{
+		cout<<a[i]<<" ";
+	}
+	cout<<endl;
+	return 0;
+}

Sorting/Bubble Sort/C++/Bubble_Sort_3.cpp

@@ -0,0 +1,41 @@
+#include <iostream>
+using namespace std;
+
+void bubbleSort(int A[],int n)
+{
+    int i,j;
+    int temp;
+    for(i=0;i<n-1;i++)
+    {
+        for(j=0;j<n-i-1;j++)
+        {
+            if(A[j]<A[j+1])
+            {
+                temp=A[j];
+                A[j]=A[j+1];
+                A[j+1]=temp;
+            }
+        }
+    }
+}
+
+int main()
+{
+    int n;
+    cout<<"Enter the size of the array\n";
+    cin>>n;
+    int a[n];
+    cout<<"Enter the element\n";
+    for(int i=0;i<n;i++)
+    {
+        cin>>a[i];
+    }
+    bubbleSort(a,n);
+    cout<<"The Sorted array is :-";
+    for(int i=0;i<n;i++)
+    {
+        cout<<a[i]<<" ";
+    }
+    cout<<endl;
+    return 0;
+}

Sorting/Bubble Sort/C/Bubble_Sort_1.c

@@ -0,0 +1,40 @@
+#include <stdio.h> 
+  
+void swap(int *xp, int *yp) 
+{ 
+    int temp = *xp; 
+    *xp = *yp; 
+    *yp = temp; 
+} 
+  
+// A function to implement bubble sort 
+void bubbleSort(int arr[], int n) 
+{ 
+   int i, j; 
+   for (i = 0; i < n-1; i++)       
+  
+       // Last i elements are already in place    
+       for (j = 0; j < n-i-1; j++)  
+           if (arr[j] > arr[j+1]) 
+              swap(&arr[j], &arr[j+1]); 
+} 
+  
+/* Function to print an array */
+void printArray(int arr[], int size) 
+{ 
+    int i; 
+    for (i=0; i < size; i++) 
+        printf("%d ", arr[i]); 
+    printf("n"); 
+} 
+  
+// Driver program to test above functions 
+int main() 
+{ 
+    int arr[] = {64, 34, 25, 12, 22, 11, 90}; 
+    int n = sizeof(arr)/sizeof(arr[0]); 
+    bubbleSort(arr, n); 
+    printf("Sorted array: \n"); 
+    printArray(arr, n); 
+    return 0; 
+} 

Sorting/Bubble Sort/C/Bubble_Sort_2.c

@@ -0,0 +1,34 @@
+#include <stdio.h>
+ 
+int main()
+{
+  int array[100], n, c, d, swap;
+ 
+  printf("Enter number of elements\n");
+  scanf("%d", &n);
+ 
+  printf("Enter %d integers\n", n);
+ 
+  for (c = 0; c < n; c++)
+    scanf("%d", &array[c]);
+ 
+  for (c = 0 ; c < n - 1; c++)
+  {
+    for (d = 0 ; d < n - c - 1; d++)
+    {
+      if (array[d] > array[d+1]) /* For decreasing order use < */
+      {
+        swap       = array[d];
+        array[d]   = array[d+1];
+        array[d+1] = swap;
+      }
+    }
+  }
+ 
+  printf("Sorted list in ascending order:\n");
+ 
+  for (c = 0; c < n; c++)
+     printf("%d\n", array[c]);
+ 
+  return 0;
+}

Sorting/Bubble Sort/Go/Bubble_Sort.go

@@ -0,0 +1,32 @@
+package main
+
+import (
+    "fmt"
+)
+
+var toBeSorted [10]int = [10]int{1,3,2,4,8,6,7,2,3,0}
+
+func bubbleSort(input [10]int) {
+    // n is the number of items in our list
+    n := 10
+    swapped := true
+    for swapped {
+        swapped = false
+        for i := 1; i < n-1; i++ {
+            if input[i-1] > input[i] {
+                fmt.Println("Swapping")
+                // swap values using Go's tuple assignment
+                input[i], input[i-1] = input[i-1], input[i]
+                swapped = true
+            }
+        }
+    }
+    fmt.Println(input)
+}
+
+
+func main() {
+    fmt.Println("Hello World")
+    bubbleSort(toBeSorted)
+    
+}

Sorting/Bubble Sort/Java/Bubble_Sort_1.java

@@ -0,0 +1,28 @@
+import java.util.Arrays;
+
+public class BubbleSort {
+	/**
+	 * The bubble sort algorithm iterates over the array multiple times, pushing big
+	 * elements to the right by swapping adjacent elements, until the array is
+	 * sorted.
+	 */
+	public static void bubbleSort(int[] array, int leftIndex, int rightIndex) {
+		for (int i = leftIndex; i < rightIndex; i++) {
+			for (int j = leftIndex; j < rightIndex; j++) {
+				if (array[j] > array[j + 1]) {
+					int aux = array[j];
+					array[j] = array[j + 1];
+					array[j + 1] = aux;
+				}
+			}
+		}
+	}
+  /**
+   * Main Method
+   */
+	public static void main(String[] args) {
+		int[] array = { 8, 2, 3, 4, 1, 5, 7, 6 };
+		bubbleSort(array, 0, array.length - 1);
+		System.out.println(Arrays.toString(array));
+	}
+}

Sorting/Bubble Sort/Java/Bubble_Sort_2.java

@@ -0,0 +1,75 @@
+/*
+ * To change this license header, choose License Headers in Project Properties.
+ * To change this template file, choose Tools | Templates
+ * and open the template in the editor.
+ */
+
+import java.util.Scanner;
+ 
+/**
+ * 
+ * @author Yudi Setiawan
+ * 
+ * Bubble Sort
+ *
+ */
+ 
+public class BubleSort
+{
+    public static void main(String[] args)
+    {
+        Scanner s = new Scanner(System.in);
+         
+        System.out.print("Input data n : ");    int n_data = s.nextInt();
+        
+        int[] data = new int[n_data];       
+        System.out.println();
+        for(int a = 0; a < n_data; a++)
+        {
+            System.out.print("Data -"+(a+1)+" : ");
+            data[a] = s.nextInt();
+        }
+        
+        System.out.println("\nData before sorted");
+        for(int a = 0; a < n_data; a++)
+            System.out.print(data[a]+" ");
+         
+        //    Proses Bubble Sort
+        System.out.println("\nProcces Bubble Sort");
+        for(int a = 0; a < n_data; a++)
+        {
+            System.out.println("Iterasi -"+(a+1)+" :");
+            for(int b = 0; b < n_data; b++)
+                System.out.print(data[b]+"  ");
+             
+            System.out.println("   Compare "+data[0]+" with "+data[1]);
+            for(int b = 0; b < n_data-1; b++)
+            {
+                String Message = "   There is no sorting";
+                if(data[b] > data[b+1])
+                {
+                    Message = "   Data "+data[b]+" switch with "+data[b+1];
+                    int temp = data[b];        
+                    data[b] = data[b+1];    
+                    data[b+1] = temp;
+                     
+                }
+             
+                if(b < n_data-(a+1))
+                {
+                    for(int c = 0; c < n_data; c++)
+                        System.out.print(data[c]+"  ");
+                     
+                    System.out.println(Message);;
+                }
+            }
+ 
+            System.out.println("\n");
+        }
+         
+        System.out.print("Data after Sorted : ");
+        for(int a = 0; a < n_data; a++)
+            System.out.print(data[a]+"  ");
+         
+    }
+}

Sorting/Bubble Sort/Java/Bubble_Sort_Optimized.java

@@ -0,0 +1,38 @@
+import java.util.Arrays;
+
+public class OptimizedBubbleSort {
+    static void sort(int [] arrA){
+        if(arrA==null || arrA.length==0)
+            return;
+
+        System.out.println("Original Array: " + Arrays.toString(arrA));
+        boolean isSwapped;
+        int size = arrA.length;
+        for (int i = 0; i <size-1 ; i++) {
+            isSwapped = false;
+            for (int j = 0; j <size-i-1 ; j++) {
+                //check the adjacent elements
+                if(arrA[j]>arrA[j+1]){
+                    //swap the elements
+                    int temp = arrA[j];
+                    arrA[j] = arrA[j+1];
+                    arrA[j+1] = temp;
+                    isSwapped = true;
+                }
+            }
+            //check if any swapping occurred in last iteration
+            //if yes then break the loop, array is sorted at this point
+            if(isSwapped==false)
+                break;
+        }
+        System.out.println("Sorted Array: " +  Arrays.toString(arrA));
+    }
+
+    public static void main(String[] args) {
+        int [] arrA = {5, 1, 9, 3, 2, 10};
+        sort(arrA);
+        System.out.println("------------------------------");
+        arrA = new int []{1, 2, 4, 6, 8, 10};
+        sort(arrA);
+    }
+}