PPS Practical 36

• PPS(C)
• JAvA

• Aim: Write a program to sort given array in ascending order (Use Insertion sort, Bubble sort, Selection sort, Mergesort, Quicksort, Heapsort).
• Code:

  //For turbo C++ remove below comments
  #include <stdio.h>
  //#include<conio.h>
  void main()
  {
      int n,i,j,arr[99];
      //clrscr();
      printf("Enter length array : ");
      scanf("%d",&n);
      printf("Enter elements for array: \n");
      for (i = 0; i < n; i++){
          scanf("%d",&arr[i]);
      }
      printf("Sorted array : ");
      for (i = 0; i < n-1; i++){
          for ( 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;
              }
          }
      }
      for ( i = 0; i < n; i++){
          printf("%d ",arr[i]);
      }
      // getch();
  }

• Output:
  

Practical 35 Practical 37