Sample C Code and Programs

Request a code

2013-08-02T14:30:00.001+05:30

Free sample code, example code , code snippet , tutorials in C C++. Find, download and reuse the code database available which varies from small programs to large ones as well. Feel free to request for code that is not in the list. You can post a comment on this post to get the code which is not listed here. I would try to provide you that at the earliest.

Anagrams : How to find whether two strings are anagrams or not

2013-07-31T12:38:00.001+05:30

Anagram in c: c program to check whether two strings are anagrams or not, string is assumed to consist of alphabets only. Two words are said to be anagrams of each other if the letters from one word can be rearranged to form the other word. From the above definition it is clear that two strings are anagrams if all characters in both strings occur same number of times. For example "abc" and "cab"

XML based IVR

2013-07-31T12:03:00.002+05:30

The paper presents the architecture of a web based interactive voice response system using Voice XML. The paper includes a discussion on the architecture of the IVR system, its components, and a detailed description of the functionality of VXML Interpreter and its use in IVR systems. It also describes the integration of VXML Interpreter, CCXML Interpreter and the related media & telephony

Fibonacci series

2013-07-24T12:25:00.000+05:30

In mathematics, the Fibonacci numbers or Fibonacci series or Fibonacci sequence are the numbers in the following integer sequence: 0,1,1,2,3,5,8,13,21,34,55,89 By definition, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two. In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation

Composite Numbers

2012-10-06T23:50:00.002+05:30

The following programs will find if a number is composite or not and will print a series of composite numbers. A composite number is a positive integer that has a positive divisor other than one or itself. In other words a composite number is any positive integer greater than one that is not a prime number. So, if n > 0 is an integer and there are integers 1 < a, b < n such that n = a × b, then

Radix Sort: Sample program for Radix Sort

2010-10-05T22:17:00.001+05:30

This C program will sort a given array using Radix Sort #define NUMELTS 100 # include <stdio.h> #include <conio.h> #include <math.h> void radixsort(int a[],int); void main() { int n,a[20],i; clrscr(); printf("enter the number :"); scanf("%d",&n); printf("ENTER THE DATA -"); for(i=0;i<n;i++) { printf("%d. ",i+1); scanf("%d",&a[i]); } radixsort(a,

Create 2010 Calendar In C

2010-01-17T13:57:00.001+05:30

This program will make and print a calendar for the year 2010. #include <stdio.h> int IsLeapYear(int Year) { if (Year % 400 == 0 || (Year % 4 == 0 && Year % 100 != 0)) return 1; return 0; } int DaysPassedFromYear(int firstYear, int month,int year) { int days; int daysPassed[] = { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334}; //per month per year

Make or print calendar for any year

2009-11-12T22:38:00.005+05:30

This program will make and print a calendar for any year starting from 1800 AD. However 1800 is not a fixed starting point, you can tweak the code and change firstYear, dayOffset and firstLeapYear to get any starting point. The dayoffset is the first day of our start year which may not be a Sunday ( in 1800 it was Wednesday). The logic goes like that it first calculates the number of days passed

Bubble Sort : Sample program for bubble sort

2009-10-27T19:34:00.003+05:30

Bubble sort works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm gets its name from the way smaller elements "bubble" to the top of the list.void BubbleSort(int a[], int n){ int i,

Heap Sort : Sample program for heap sort

2009-08-25T20:28:00.009+05:30

#include#include/* array of MAXARRAY length ... */#define MAXARRAY 5void heapsort(int ar[], int len);/* heapsort() to bubble down starting at pos[ition] */void heapbubble(int pos, int ar[], int len);int main(void){int array[MAXARRAY];int i = 0;/* load some random values into the array *//* print the original array */printf("Before heapsort: ");for(i = 0; i < MAXARRAY;i++){printf(" %d ", array[i])

Binary search : Sample program

2009-08-19T01:14:00.010+05:30

#include #define TRUE 0#define FALSE 1int main(void) { int array[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; int left = 0; int right = 10; int middle = 0; int number = 0; int bsearch = FALSE; int i = 0; printf("ARRAY: "); for(i = 1; i <= 10; i++) printf("[%d] ", i); printf("\nSearch for Number: "); scanf("%d", &number); while(bsearch == FALSE && left <= right) { middle = (left + right) / 2; if(

Tokenize String : an alternate to strtok

2009-08-10T23:56:00.008+05:30

This function tokenizes a given string based on white spaces(Blank spaces,new line & tabs) . If you want to tokenize on a particular character like ',' or something else pass the character as c_Delimiter in the function argument. Following test program describes the use of the function.#include "stdio.h"#include "string.h"int TokenizeString(char *s_String, char s_Token[][25], char c_Delimiter

Linking in C

2009-07-28T23:02:00.001+05:30

Computer programs typically comprise several parts or modules; all these parts/modules need not be contained within a single object file, and in such case refer to each other by means of symbols. Typically, an object file can contain three kinds of symbols:defined symbols, which allow it to be called by other modules.Undefined symbols, which call the other modules where these symbols are

Pointer Basics

2009-07-28T22:39:00.004+05:30

A pointer references a value stored elsewhere in memory, and obtaining or requesting the value to which a pointer refers is called dereferencing the pointer. The pointer variable doesnt store the value of the variable itself but it points to the memory address where the value is stored.Eg. if we say a is a pointer to b then, a stores the address where the b is located i.e. 1462. It means value

strcat

2009-07-28T21:54:00.003+05:30

//strcat - concatenating of two stringschar * strcat ( char * destination, const char * source ){ char *d = destination; while (*d) ++d; while ((*d++ = *source++) != '\0') ; return (destination);}

strcmp

2009-07-20T20:11:00.005+05:30

//comparing s1 and s2; return 0 if strings are equal and number when they are not equalint strcmp(const char *s1, const char *s2){ while (*s1==*s2 ) { if(*s1=='\0') return 0; s1++;s2++; } return(*s1-*s2);}