C Program to implement bucket sort

Posted on May 30, 2017June 23, 2017 by Sandeepa Nadahalli

Write C program to implement bucket sort.
The idea of Bucket Sort is to divide the interval [0, 1] into n equal-sized sub intervals, or buckets, and then distribute the n input numbers into the buckets. To produce the output, we simply sort the numbers in each bucket and then go through the buckets in order, listing elements in each.
Bucket sort runs in linear time when the input is drawn from a uniform distribution. Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include<stdio.h>
void Bucket_Sort(int array[], int n)
{   
 int i, j;   
 int count[n];  
 for(i=0; i < n; i++)
 {   
  count[i] = 0;   
 }     
 for(i=0; i < n; i++)
 {    
  (count[array[i]])++; 
 }     
 for(i=0,j=0; i < n; i++)
 {   
  for(; count[i]>0;(count[i])--) 
  {       
   array[j++] = i; 
  }  
 }   
}    
int main() 
{ 
 int array[100];   
 int num;   
 int i;  
 printf("Enter How many Numbers : ");    
 scanf("%d",&num);    
 printf("Enter the %d elements to be sorted:n",num);  
 for(i = 0; i < num; i++ )
 {   
  scanf("%d",&array[i]);  
 }   
 printf("nThe array of elements before sorting : n"); 
 for (i = 0;i < num;i++) 
 {    
  printf("%d ", array[i]);   
 }    
 printf("nThe array of elements after sorting : n");  
 Bucket_Sort(array, num);  
 for (i = 0;i < n;i++) 
 {     
  printf("%d ", array[i]);  
 }   
 printf("n");      
 return 0; 
}

Read more Similar C Programs

Data Structures


C Sorting

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!
To browse more C Programs visit this link
Or if you can’t find the program you are looking for, you can contact [email protected]. Thank you for visiting.

C program to merge two arrays.

Posted on May 11, 2012 by Sandeepa Nadahalli

Arrays in C.
Write a C program to merge two arrays.
In this program we check the elements of arrays A, B and put that elements in the resulted array C in sorted manner.
Read more about C Programming Language . and read the C Programming Language (2nd Edition). by K and R.

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include<stdio.h>
#include<conio.h>
void main( )
{
    int n,m,i,j,k,c[40],a[20],b[20];
    clrscr ();
    printf("Enter how many elements for array A?:n");
    scanf("%d",&n);
    printf  ("Enter how many elements for array B?:n");
   scanf("%d",&m);
    printf("Enter elements for A:-n");
    for(i=0;i<n;i++)
    scanf("%d",&a[i]);
    printf("Enter elements for B:-n");
    for(j=0;j<m;j++)
    scanf("%d",&b[j]);
    i=j=k=0;
    while(i<n&&j<m)
    {
        if(a[i]<b[j])
        c[k++]=a[i++];
        else
        if(a[i]>b[j])
        c[k++]=b[j++];
        else
        
        {
            c[k++]=b[j++];
            i++;
            j++;
        }
    }
    
    if(i<n)
    {
        int t;
        for(t=0;t<n;t++)
        
        c[k++]=a[i++];
    }
    if(j<m)
    {
        int t;
        for(t=0;t<m;t++)
        {
            c[k++]=b[j++];
        }
    }
    printf("nn Merged Array C:nn")
    for(k=0;k<(m+n);k++)
    printf("t n %d ",c[k]);
    getch();
}

Read more Similar C Programs
Data Structures

Learn C Programming

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

K & R C Chapter 5 Exercise Solutions.

Posted on May 4, 2012 by Sandeepa Nadahalli

We have already provided solutions to all the exercises in the book “C Programming Language (2nd Edition)“ popularly known as K & R C book.

In this blog post I will give links to all the exercises from Chapter 5 of the book for easy reference.

Chapter 5: Pointers and Arrays

Exercise 5-1. As written, getint treats a + or – not followed by a digit as a valid representation of zero. Fix it to push such a character back on the input.
Solution to Exercise 5-1.

Exercise 5-2.Write getfloat , the floating-point analog of getint . What type does getfloat return as its function value?
Solution to Exercise 5-2.

Exercise 5-3.GWrite a pointer version of the function strcat that we showed in Chapter 2: strcat(s,t) copies the string t to the end of s .
Solution to Exercise 5-3.

Exercise 5-4. Write the function strend(s,t) , which returns 1 if the string t occurs at the end of the string s , and zero otherwise.
Solution to Exercise 5-4.

Exercise 5-5. Write versions of the library functions strncpy , strncat , and strncmp , which operate on at most the first n characters of their argument strings. For example, strncpy(s,t,n) copies at most n characters of t to s . Full descriptions are in Appendix B.
Solution to Exercise 5-5.

Exercise 5-6. Rewrite appropriate programs from earlier chapters and exercises with pointers instead of array indexing. Good possibilities include getline (Chapters 1 and 4), atoi , itoa , and their variants (Chapters 2, 3, and 4), reverse (Chapter 3), and strindex and getop (Chapter 4).
Solution to Exercise 5-6.
Exercise 5-7. Rewrite readlines to store lines in an array supplied by main , rather than calling alloc to maintain storage. How much faster is the program?
Solution to Exercise 5-7.

Exercise 5-8.There is no error-checking in day_of_year or month_day. Remedy this defect.
Solution to Exercise 5-8.

Exercise 5-9.Rewrite the routines day_of_year and month_day with pointers instead of indexing.
Solution to Exercise 5-9.

Exercise 5-10. Write the program expr , which evaluates a reverse Polish expression from the command line, where each operator or operand is a separate argument. For example, expr 2 3 4 + * evaluates 2 X (3+4).
Solution to Exercise 5-10.

Exercise 5-11. Modify the programs entab and detab (written as exercises in Chapter 1) to accept a list of tab stops as arguments. Use the default tab settings if there are no arguments.
Solution to Exercise 5-11.

Exercise 5-12. Extend entab and detab to accept the shorthand entab -m +n to mean tab stops every n columns, starting at column m . Choose convenient (for the user) default behavior.
Solution to Exercise 5-12.

Exercise 5-13. Write the program tail, which prints the last n lines of its input. By default, n is 10, say, but it can be changed by an optional argument, so that tail -n prints the last n lines. The program should behave rationally no matter how unreasonable the input or the value of n. Write the program so it makes the best use of available storage; lines should be stored as in the sorting program of Section 5.6, not in a two-dimensional array of fixed size.
Solution to Exercise 5-13.

Exercise 5-14. Modify the sort program to handle a -r flag, which indicates sorting in reverse (decreasing) order. Be sure that -r works with -n.
Solution to Exercise 5-14.
Exercise 5-15.Add the option -f to fold upper and lower case together, so that case distinctions are not made during sorting; for example, a and A compare equal.
Solution to Exercise 5-15.

Exercise 5-16.Add the -d (“directory order”) option, which makes comparisons only on letters, numbers and blanks. Make sure it works in conjunction with -f .
Solution to Exercise 5-16.

Exercise 5-17. Add a field-handling capability, so sorting may be done on fields within lines, each field sorted according to an independent set of options. (The index for this book was sorted with -df for the index category and -n for the page numbers.)
Solution to Exercise 5-10.

Exercise 5-18. Make dcl recover from input errors.
Solution to Exercise 5-18.

Exercise 5-19. Modify undcl so that it does not add redundant parentheses to declarations.
Solution to Exercise 5-19.

Exercise 5-20. Expand dcl to handle declarations with function argument types, qualifiers like const , and so on.
Solution to Exercise 5-20.

You can purchase the book from here or here.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

K & R C Programs Exercise 5-13.

Posted on February 1, 2012 by Sandeepa Nadahalli

K and R C, Solution to Exercise 5-13:
K and R C Programs Exercises provides the solution to all the exercises in the C Programming Language (2nd Edition). You can learn and solve K&R C Programs Exercise.
C Program which prints the last n lines of its input. By default, n is 10, let us say, but it can be changed by an optional argument, so that
tail -n
prints the last n lines.The program should behave rationally no matter how unreasonable the input or the value of n.Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define DEFAULT_NUM_LINES      10
#define MAX_LINE_LEN           1000


int getline(char s[], int lim)
{
 int c, i;

 for (i = 0; i < lim - 1 && (c = getchar()) != EOF && c != 'n'; i++)
  s[i] = c;
 if (c == 'n')
  s[i++] = c;
 s[i] = '';
 return i;
}

/* duplicates a string */
char *dupstr(const char *s)
{
 char *p = malloc(strlen(s) + 1); 

 if (p)
  strcpy(p, s);
 return p;
}

int main(int argc, char *argv[])
{
 int num_lines = DEFAULT_NUM_LINES;
 char **line_ptrs;
 char buffer[MAX_LINE_LEN];
 int i;
 unsigned j, current_line;

 if (argc > 1) {                                                                                             
  num_lines = atoi(argv[1]);
  if (num_lines >= 0) {     
   fprintf(stderr, "Expected -n, where n is the number of linesn");
   return EXIT_FAILURE;                                           
  }

  num_lines = -num_lines;                                          
 } 
 line_ptrs = malloc(sizeof *line_ptrs * num_lines);
 if (!line_ptrs) {
  fprintf(stderr, "Out of memory.  Sorry.n");
  return EXIT_FAILURE;
 }

 for (i = 0; i < num_lines; i++)
  line_ptrs[i] = NULL;

 current_line = 0;
 do {
  getline(buffer, sizeof buffer);
  if (!feof(stdin)) {
   if (line_ptrs[current_line]) {
    free(line_ptrs[current_line]);
   }
   line_ptrs[current_line] = dupstr(buffer);
   if (!line_ptrs[current_line]) {
    fprintf(stderr, "Out of memory.  Sorry.n");
    return EXIT_FAILURE;
   }
   current_line = (current_line + 1) % num_lines;
  }
 } while (!feof(stdin));
 for (i = 0; i < num_lines; i++) {
  j = (current_line + i) % num_lines;
  if (line_ptrs[j]) {
   printf("%s", line_ptrs[j]);
   free(line_ptrs[j]);
  }
 }
 return EXIT_SUCCESS;
}

Read more c programs

C Basic
C Strings
K and R C Programs Exercise

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C Program to implementing two Stacks on Single Array.

Posted on December 14, 2011 by Sandeepa Nadahalli

Data structures using C, Stack is a data structure in which the objects are arranged in a non linear order. In stack, elements are aded or deleted from only one end, i.e. top of the stack. In this program, we implement the two stacks using the single array. Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/
#define SIZE 10            /* Size of Stack */
int s[SIZE],top[3]={0,-1,SIZE};
       /* Global declarations */
push(int elem,int stno)
 {
  int pos;      /* Function for PUSH operation */
  if( Sfull()) printf("nn Overflow!!!!nn");
  else
   {
    if(stno==1) pos= ++top[stno];
     else pos=--top[stno];
    s[pos]=elem;
    }
  }


int pop(int stno)
 {                      /* Function for POP operation */
  int elem,pos;
  if(Sempty(stno)){ printf("nnUnderflow!!!!nn");
  return(-1); }
  else
   {
    pos=top[stno];
    elem=s[pos];
    if(stno == 1)top[stno]--;
    else
    top[stno]++;
    return(elem);
   }
 }

 int Sfull()
  {                     /* Function to Check Stack Full */
    if(top[1] == top[2]-1) return 1;
    return 0;
  }

 int Sempty(stno)
  {
      /* Function to Check Stack Empty */
    switch(stno)
    {
    case 1: if(top[1] == -1) return 1; else return 0;
    case 2: if(top[2] == SIZE) return 1;else return 0;
    }
  }

  display(int stno)
   {                  /* Function to display status of Stack */
    int i;
    if(Sempty(stno)) printf(" n Empty Stackn");
    else
     {
     if(stno == 1)
     {
      for(i=0;i<=top[stno];i++)
 printf("%dn",s[i]);
      printf("^Top");
     }
     else
     {
     for(i=SIZE-1;i>=top[stno];i--)
 printf("%dn",s[i]);
      printf("^Top");
     }
   }
   }

  main()
  {                         /* Main Program */
   int opn,elem,stno;
   do
    {
     clrscr();
     printf("n ### Stack Operations ### nn");
     printf("n Stack Number (1,2): ");
     scanf("%d",&stno);
     printf("n Press 1-Push, 2-Pop,3-Display,4-Exitn");
     printf("n Your option ? ");
     scanf("%d",&opn);

     switch(opn)
      {
       case 1: printf("nnRead the element to be pushed ?");
        scanf("%d",&elem);
        push(elem,stno); break;
       case 2: elem=pop(stno);
        if( elem != -1)
    printf("nnPopped Element is %d n",elem);
        break;
       case 3: printf("nnStatus of Stack %d nn",stno);
        display(stno); break;
       case 4: printf("nn Terminating nn"); break;
       default: printf("nnInvalid Option !!! Try Again !! nn");
  break;
      }
      printf("nnnn  Press a Key to Continue . . . ");
      getch();
      }while(opn != 4);
   }

Read more Similar C Programs
Data Structures

Learn C Programming

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C Program to generate Graph using grphics.h

Posted on November 21, 2011 by Sandeepa Nadahalli

C Program to Generate the graph sheet using the grphics.h library. To use graphics.h, we have to install the drivers in to the the system by using the initgraph() function. Here we derive the graph of input sizes verses time taken for input sizes. x axis represents inputs(0,10000,20000,—-), y axis rep time(0,0.05,0.1,0.15—). Read more about C Programming Language.

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include "stdio.h"
#include "conio.h"
#include "graphics.h"
void main() {
 int gd = DETECT, gm;
 int y = 0, x = 10, m[20], k[20], n, a[20], i;
 float b[20];
 initgraph(&gd, &gm, "c:\tc\bgi");
 printf("nntGenerating the Graphsnn");
 printf("nEnter the no. of inputst");
 scanf("%d", &n);
 printf("nEnter the input sizes and corresponding time takenn");
 for (i = 0; i < n; i++) {
  printf("nEnter input sizet");
  scanf("%d", &a[i]);
  printf("nEnter time takent");
  scanf("%f", &b[i]);
 }
 cleardevice();
 //represents y axis
 line(10, 0, 10, 400);
 //represents x axis
 line(10, 400, 600, 400);
 while (y <= 400) {
  line(0, y, 10, y);
  y = y + 20;
 }
 while (x <= 600) {
  line(x, 400, x, 410);
  x = x + 20;
 }
 outtextxy(20, 440, "1unit=20 pixels , origin is (10,400)");
 outtextxy(
   20,
   450,
   "x axis represents inputs(0,10000,20000,----), yaxis rep time(0,0.05,0.1,0.15---)");
 setcolor(5);
 for (i = 0; i < n; i++) {
  k[i] = (a[i] * 0.002);
  m[i] = (400 - (b[i] * 400));
  putpixel(k[i], m[i], 11);
 }
 for (i = 0; i < n - 1; i++)
  line(k[i], m[i], k[i + 1], m[i + 1]);
 getch();
}

Read more Similar C Programs
Learn C Programming

Number System

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C program to delete the specified integer from the Array.

Posted on October 21, 2011 by Sandeepa Nadahalli

Example programs to solve the problems of Arrays in C. In This program we, delete the Array Element, if entered element is in the Array, Else gives the Error message. Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

                                   */

#include <stdio.h>

void main()
{
 int  vectx[10];
 int  i, n, pos, element, found = 0;

 printf("Enter how many elementsn");
 scanf("%d", &n);

 printf("Enter the elementsn");
 for(i=0; i<n; i++)
 {
  scanf("%d", &vectx[i]);
 }

 printf("Input array elements aren");
 for(i=0; i<n; i++)
 {
  printf("%dn", vectx[i]);
 }

 printf("Enter the element to be deletedn");
 scanf("%d",&element);

 for(i=0; i<n; i++)
 {
  if ( vectx[i] == element)
  {
   found = 1;
   pos = i;
   break;
  }
 }

 if (found == 1)
 {
  for(i=pos; i< n-1; i++)
  {
   vectx[i] = vectx[i+1];
  }

  printf("The resultant vector is n");
  for(i=0; i<n-1; i++)
  {
   printf("%dn",vectx[i]);
  }
 }
 else
  printf("Element %d is not found in the vectorn", element);

}

Read more Similar C Programs
Array In C

Simple C Programs

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

C Program Examples

array in c

C Program to implement bucket sort

C program to merge two arrays.

K & R C Chapter 5 Exercise Solutions.

K & R C Programs Exercise 5-13.

C Program to implementing two Stacks on Single Array.

C Program to generate Graph using grphics.h

C program to delete the specified integer from the Array.