C Program to sort n numbers using Bubble Sort algorithm

#include<stdio.h>#include<stdlib.h>int *a,n;void bubblesort();void swap_w(int,int);main(){ int i,j; printf("Enter the number of elements "); scanf("%d",&n); a=(int *)calloc(n,sizeof(int)); printf("Enter the elements\n"); for(i=0;i<n;i++) scanf("%d",a+i); bubblesort(0,n-1); printf("The sorted sequence is\n"); for(i=0;i<n;i++) printf("%d ",a[i]); printf("\n"); return;}void bubblesort(){ int i,j; for(i=0;i<n-1;i++) for(j=n-1;j>=i+1;j--)...

Continue

ARRAYS IN C

Written by Kousik : C provides some fundamental DATA types. They are int, float, char, double. They are very useful and important in C language. But they have a limiting fact. The fact is that a variable of these types can store only one value at a time. With variables of those types we cannot handle a large volume of data of same type at a time. So we need a powerful data type with which we can solve this problem. C supports such a data type called...

Continue

Example of checking palindrome and prime number

Here in this post we represent two basic C programming examples. Those example are only for the beginners. v  Check whether a number is palindrome or not through C program. v  Check whether a number is prime or not through C program. Now the answers are given below: Answer of no 1: A number is said to be palindrome if the reverse of that number is same as the original number. Coding is given below… /* C program to check whether...

Continue

Algorithm of Insertion Sort

Written by Kousik :  This is another efficient way of solving a problem related with sorting. This algorithm works as the way people play cards. We present our procedure for insertion sort by the name INSERTION. This function takes an array of n element as input which is to be sorted. This algorithm sorts given n elements by inserting them into their right position. Procedure INSERTION {   For i=1 to n-1 do   Insert(i);  ...

Continue

Algorithm of Quicksort

Written by Kousik :   QUICKSORT(S)  { 1.       If ||S||<=1 return; else {        2.                Select a first element e as pivot from s.        3.                 Compare elements of...

Continue

Sorting

Written by Kousik :  “Sorting”, this word must come when you are reading C programming language as well as algorithm. This is important part of C programming and very interested problem. Many algorithms for sorting are there. In this section we discuss about several sorting algorithms and their time and space complexity. Definition: Input: A sequence of n numbers from linearly ordered set or totally ordered set. Output: A permutation...

Continue

C Program for Merge Sort

#include<stdio.h>#include<stdlib.h>int *a;void m_sort(int,int);void sort(int,int,int);main(){  int n,i;  printf("Enter the number of elements (it should be power of 2) ");  scanf("%d",&n);  a=(int *)calloc(n,sizeof(int));  printf("Enter the values ");  for(i=0;i<n;i++)  scanf("%d",a+i);  m_sort(0,n-1);  printf("The sorted array is \n");  for(i=0;i<n;i++)  printf("%d ",a[i]); ...

Continue