java

import java.util.Scanner;
 
class BubbleSort {
  public static void main(String []args) {
    int n, c, d, swap;
    Scanner in = new Scanner(System.in);
 
    System.out.println("Input number of integers to sort");
    n = in.nextInt();
 
    int array[] = new int[n];
 
    System.out.println("Enter " + n + " integers");
 
    for (c = 0; c < n; c++)
      array[c] = in.nextInt();
   
    for (c = 0; c < ( n - 1 ); c++) {
      for (d = 0; d < n - c - 1; d++) {
        if (array[d] > array[d+1]) /* For descending order use < */
        {
          swap       = array[d];
          array[d]   = array[d+1];
          array[d+1] = swap;
        }
      }
    }
 
    System.out.println("Sorted list of numbers:");
 
    for (c = 0; c < n; c++)
      System.out.println(array[c]);
  }
}

2 Quicksort

class Quicksort
 {
   static void quicksort(int A[],int p,int r)
  {
  if (p < r)
   {
   int q = Partition(A, p, r);
   quicksort(A, p, q-1);
   quicksort(A, q+1 , r);
   }
  }
  static int Partition(int A[],int p,int r)
  {
  int temp;
  int x = A[r]; 
  int  i = p - 1;
   for (int j=p;j<=r-1; j++)
     {
       if (A[j] <= x)
        {
          i = i + 1;
          temp=A[i];
          A[i]=A[j];
          A[j]=temp;
          }
     }

        temp=A[i+1];
        A[i+1]=A[r];
        A[r]=temp;
        return i+1;
 }
public static void main(String args[])
    {
     int A[]={23,16,78,9,11,112};
     quicksort(A,0,A.length-1);
     System.out.println("\n sorted array");
      for(int i=0; i< A.length; i++)
        {
         System.out.println(A[i]+ "");
        }
        }
   }