EmbLogic » sorting https://www.emblogic.com/blog Embedded System and ARM Training Tue, 03 Mar 2020 13:00:06 +0000 en-US hourly 1 http://wordpress.org/?v=3.9.1 Bubble sorting using function https://www.emblogic.com/blog/01/bubble-sorting-using-function/ https://www.emblogic.com/blog/01/bubble-sorting-using-function/#comments Sat, 23 Jan 2016 06:00:50 +0000 http://www.emblogic.com/blog/?p=13184 Continue reading →]]> #include<stdio.h>
//Program for Bubble Sorting
int * bubblesort(int*,int);
int display(int *,int);
int main()
{
int i,j,a[100],N,temp;

printf(“Enter no.of elements you want to sort:\t”);
scanf(“%d”,&N);//Max. no. of elements
printf(“Enter %d elements you want to sort:\n”,N);
for(i=0;i<N;i++)
scanf(“%d”,(a+i));
printf(“\nBefore sorting:\t”);
display(a,N);
//Sorting Starts
bubblesort(a,N);
//Sorting Ends
printf(“\nAfter sorting:\t”);
display(a,N);
}

int * bubblesort(int *a,int N)
{
int i,j,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;
}
return a;

}
int display(int* a,int N)
{
int i;
for(i=0;i<N;i++)
printf(“%d\t”,*(a+i));

return 0;
}

]]> https://www.emblogic.com/blog/01/bubble-sorting-using-function/feed/ 0 Selection Sorting in C https://www.emblogic.com/blog/01/selection-sorting-in-c/ https://www.emblogic.com/blog/01/selection-sorting-in-c/#comments Sun, 10 Jan 2016 10:03:19 +0000 http://www.emblogic.com/blog/?p=13144 Continue reading →]]> #include<stdio.h>
//Program for Selection Sorting
int main()
{
int i,j,a[100],N,temp;

printf(“Enter no.of elements you want to sort:\t”);
scanf(“%d”,&N);//max no. of elements
printf(“Enter %d elements you want to sort:\n”,N);
for(i=0;i<N;i++)
scanf(“%d”,(a+i));
printf(“\nBefore sorting:\t”);
for(i=0;i<N;i++)
printf(“%d\t”,*(a+i));
//Sorting Starts
for(i=0;i<N-1;i++)
for(j=i+1;j<N;j++)
if(a[i]>a[j])
{
temp = a[j];
a[j]=a[i];
a[i]=temp;
}
//Sorting Ends
printf(“\nAfter sorting:\t”);
for(i=0;i<N;i++)
printf(“%d\t”,*(a+i));
}

]]> https://www.emblogic.com/blog/01/selection-sorting-in-c/feed/ 0 Bubble Sorting in C https://www.emblogic.com/blog/01/bubble-sorting-in-c/ https://www.emblogic.com/blog/01/bubble-sorting-in-c/#comments Sun, 10 Jan 2016 09:58:16 +0000 http://www.emblogic.com/blog/?p=13142 Continue reading →]]> #include<stdio.h>
//Program for Bubble Sorting
int main()
{
int i,j,a[100],N,temp;

printf(“Enter no.of elements you want to sort:\t”);
scanf(“%d”,&N);//Max. no. of elements
printf(“Enter %d elements you want to sort:\n”,N);
for(i=0;i<N;i++)
scanf(“%d”,(a+i));
printf(“\nBefore sorting:\t”);
for(i=0;i<N;i++)
printf(“%d\t”,*(a+i));
//Sorting Starts
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;
}
//Sorting Ends
printf(“\nAfter sorting:\t”);
for(i=0;i<N;i++)
printf(“%d\t”,*(a+i));
}

]]> https://www.emblogic.com/blog/01/bubble-sorting-in-c/feed/ 0 Insertion Sorting https://www.emblogic.com/blog/01/insertion-sorting-2/ https://www.emblogic.com/blog/01/insertion-sorting-2/#comments Sun, 10 Jan 2016 09:55:11 +0000 http://www.emblogic.com/blog/?p=13140 Continue reading →]]> #include<stdio.h>
//Program for Insertion Sorting
int main()
{
int i,j,k,N,a[100],temp;
printf(“Enter no. of elements you want to sort :\t”);
scanf(“%d”,&N);//Max. no. of elements
printf(“Enter %d elements you want to sort :\t”,N);
for(i=0;i<N;i++)
scanf(“%d”,(a+i));
printf(“\nBefore Sorting:\t”);
for(i=0;i<N;i++)
printf(“%d\t”,*(a+i));
//Sorting Process Start
for(i=1;i<N;i++)
for(j=0;j<i;j++)
if(a[i]<a[j])
{
temp = a[i];
for(k=i;k>j;k–)
{
a[k]=a[k-1];
}
a[j]=temp;
}

//Sorting Ends
printf(“\nAfter Sorting:\t”);
for(i=0;i<N;i++)
printf(“%d\t”,*(a+i));
return 0;
}

]]> https://www.emblogic.com/blog/01/insertion-sorting-2/feed/ 0 Quick Sort using recursion https://www.emblogic.com/blog/07/quick-sort-using-recursion-2/ https://www.emblogic.com/blog/07/quick-sort-using-recursion-2/#comments Fri, 17 Jul 2015 05:27:27 +0000 http://www.emblogic.com/blog/?p=12906 Continue reading →]]> //Quick sorting using Recursion
#include<stdio.h>
#include<stdlib.h>
//Prototypes of functions used
int * input(int *,int);
int * sort(int *,int);
void display(int*,int);
int main()
{
int *a,n;
printf(“Enter number of numbers you want to sort?\n”);
scanf(“%d”,&n);
a = input(a,n);
a = sort(a,n);//call to quick sort
display(a,n);
return 0;
}
//Function to input an array
int * input(int *a,int n)
{
int i;
printf(“Enter %d elements\n”,n);
a = (int *)malloc(sizeof(int)*n);
for(i=0;i<n;i++)
scanf(“%d”,&a[i]);
return a;
}
//Function to Quick Sort
int * sort(int *data,int n)
{
int too_small_index,too_big_index,pivot,temp;
pivot = 0;//Index of pivot element
too_big_index = pivot + 1;
too_small_index = n – 1;
//Terminating condition for recursive call
if(too_big_index>too_small_index)
return data;
do
{
//Step 1
while(*(data + too_big_index)<=*(data + pivot))
++too_big_index;
//Step 2
while(*(data + too_small_index)>*(data + pivot))
–too_small_index;
//Step 3
if(too_big_index<too_small_index)
{
temp = *(data + too_big_index);
*(data + too_big_index) = *(data + too_small_index);
*(data+too_small_index) = temp;
}
}while(too_small_index>too_big_index);//Step 4
//Step 5
temp = *(data + too_small_index);
*(data + too_small_index) = *(data+pivot);
*(data+pivot) = temp;
//Sorting left side of array
if(too_small_index!=too_big_index)
data = sort(data,too_small_index);
//sorting right side of array
sort((data+too_small_index+1),n-too_small_index-1);
return data;
}
//Function to display the array
void display(int*a,int n )
{
int i;
printf(“\nSorted list\n”);
for(i=0;i<n;i++)
printf(“%d\t”,*(a+i));
}

]]> https://www.emblogic.com/blog/07/quick-sort-using-recursion-2/feed/ 0 linklist implementation using functions. https://www.emblogic.com/blog/02/linklist-implementation-using-functions/ https://www.emblogic.com/blog/02/linklist-implementation-using-functions/#comments Fri, 28 Feb 2014 14:33:37 +0000 http://www.emblogic.com/blog/?p=8458 Continue reading →]]> RCS file: lll.c,v
Working file: lll.c
head: 1.8
branch:
locks: strict
saurabh: 1.8
access list:
symbolic names:
keyword substitution: kv
total revisions: 8; selected revisions: 8
description:
created a linklist program where diff aspects are being done.
first created new linklist
second add a new node to the linklist which is already been created.
so far a new node in inserted from the begining
and from the end .

—————————-
revision 1.8 locked by: saurabh;
date: 2014/02/28 14:16:42; author: saurabh; state: Exp; lines: +3 -4
sorting function working properly
insertion at nth node is working well.
while deletion at the nth node is too working well
—————————-
revision 1.7
date: 2014/02/28 13:49:08; author: saurabh; state: Exp; lines: +1 -1
*** empty log message ***
—————————-
revision 1.6
date: 2014/02/28 13:46:44; author: saurabh; state: Exp; lines: +1 -1
problem in function insert at nth solved .
—————————-
revision 1.5
date: 2014/02/28 13:42:50; author: saurabh; state: Exp; lines: +33 -15
function called sort_ has been implemented in program .
but there are some problem in function “insert_nth”.
will solve later on
—————————-
revision 1.4
date: 2014/02/27 20:03:10; author: saurabh; state: Exp; lines: +26 -2
sorting not working :(
—————————-
revision 1.3
date: 2014/02/27 19:10:54; author: saurabh; state: Exp; lines: +19 -3
implemented function called deletition from end .
:)
—————————-
revision 1.2
date: 2014/02/27 18:17:33; author: saurabh; state: Exp; lines: +159 -30
created function called insertion at the end
created function insertion at the nth node
created function deletion
implemented all above function the are working well
implemented deletion from begining node using function
implemented deletion from the nth node successflly
prior to all such functions ,defined display function too .
:)
—————————-
revision 1.1
date: 2014/02/24 21:09:57; author: saurabh; state: Exp;
Initial revision
=============================================================================

]]> https://www.emblogic.com/blog/02/linklist-implementation-using-functions/feed/ 0