CCITcoder
Contents
Introduction to C
DataType and Operation
- Datatypes
- Format specifiers
- Operators
- Keyword/Token
- Cast Operator / type casting
- Formatted I/O
- Unformatted I/O
Conditional statements
Iterative statements
Functions
Array
Pointers
- Introduction Pointers
- call by Value/ Reference
- Passing arrays as argument
- Pointer to Pointer
- Function Pointer
- Dynamic Memory Management
Structures
File I/O
Graphics
Additional Features
Contents
Introduction to C
DataType and Operation
- Datatypes
- Format specifiers
- Operators
- Keyword/Token
- Cast Operator / type casting
- Formatted I/O
- Unformatted I/O
Conditional statements
Iterative statements
Functions
Array
Pointers
- Introduction Pointers
- call by Value/ Reference
- Passing arrays as argument
- Pointer to Pointer
- Function Pointer
- Dynamic Memory Management
Structures
File I/O
Graphics
Additional Features
Array
Searching
- It a technique of searching a value in a set of values.
- Different techniques can be used for searching
- Linear Search
- Binary Search
Linear Search
- Linear search or Sequential search is a method for finding a target value within a list.
- It sequentially checks each element of the list for the target value until a match is found or until all the elements have been searched.
#
#Write a program to read 10 nos in an array and Search for an Element in that array.
#include<stdio.h>
main()
{
int a[10],i,s;
printf("Enter 10 nos.\n");
for(i=0;i<=9;i++)
scanf("%d",&a[i]);
printf("Enter search element");
scanf("%d",&s);
for(i=0;i<=9;i++)
if(a[i]==s)
{
printf("Found");
break;
}
if(i==10)
printf("Not found");
}
Enter 10 nos.
5 8 7 9 6 2 4 1 3 10
Enter search element 6 Found
5 8 7 9 6 2 4 1 3 10
Enter search element 6 Found
#
#Write a program to read 10 nos in an array and Search for an Element and also print it location.
#include<stdio.h>
main()
{
int a[10],i,s;
printf("Enter 10 nos.\n");
for(i=0;i<=9;i++)
scanf("%d",&a[i]);
printf("Enter search no.");
scanf("%d",&s);
for(i=0;i<=9;i++)
if(a[i]==s)
{
printf("Found at location %d",i+1);
break;
}
if(i==10)
printf("Not found");
}
Enter 10 Nos
5 8 7 9 6 4 1 2 3 5
Enter Search no. 4
Found at position 6
5 8 7 9 6 4 1 2 3 5
Enter Search no. 4
Found at position 6
#
#Write a program to read 10 nos in an array and set all negative to zero.
#include<stdio.h>
main()
{
int a[10],i;
printf("Enter 10 nos.\n");
for(i=0;i<=9;i++)
scanf("%d",&a[i]);
for(i=0;i<=9;i++)
{
if(a[i]<0)
a[i]=0;
}
printf("Array is:");
for(i=0;i<=9;i++)
{
printf("%d ",arr[i]);
}
}
Enter 10 nos.
4 -7 5 8 6 -2 4 7 -9 3
Array is:
4 0 5 8 6 0 4 7 0 3
4 -7 5 8 6 -2 4 7 -9 3
Array is:
4 0 5 8 6 0 4 7 0 3
Sorting
- It is a technique of arranging data in particular order i.e. in ascending or descending order.
Bubble Sort
- This sorting algorithm is comparison-based algorithm in which each pair of adjacent elements is compared and the elements are swapped if they are not in order.
- This process is repeated as many times as necessary, until the array is sorted.
#
#Write a program to read 10 nos in array and sort that array using bubble sort.
#include<stdio.h>
main()
{
int a[10],i,j,temp;
printf("Enter 10 nos.\n");
for(i=0;i<10;i++)
scanf("%d",&a[i]);
for(j=9;j>0;j--)
for(i=0;i<j;i++)
if(a[i]>a[i+1])
{
temp=a[i];
a[i]=a[i+1];
a[i+1]=temp;
}
printf("Sorted Array\n");
for(i=0;i<10;i++)
printf("%d ",a[i]);
}
Enter 10 nos.
4 9 5 7 6 1 0 3 2 8
Sorted Array:
0 1 2 3 4 5 6 7 8 9
4 9 5 7 6 1 0 3 2 8
Sorted Array:
0 1 2 3 4 5 6 7 8 9
Binary Search
- It is used to search an Item in a sorted array
- Binary search looks for a particular item by comparing the middle most item of the collection.
- If a match occurs, then the index of item is returned.
- If the middle item is greater than the item, then the item is searched in the subarray to the left of the middle item.
- Otherwise, the item is searched in the sub-array to the right of the middle item.
- This process continues on the sub-array until the size of the subarray reduces to zero.
#
#Write a program to read 10 nos in an array and set all negative to zero.
#include<stdio.h>
int binarysearch(int a[ ],int val,int n)
{
int li,ui,mi;
li = 0;
ui = n-1;
do{
mi=(li+ui)/2;
if(a[mi]==val)
break;
if( val > a[ mi ])
li = mi +1;
else
ui = mi - 1;
}while(li<=ui);
if(li<ui)
return mi;
else
return -1;
}
main()
{
int arr[10]={2,3,5,6,8,9,10,12,15,17};
int value , result , i;
printf("\nElements are ");
for(i= 0;i<=9;i++)
printf("%d",arr[i]);
printf("\nEnter a no to Search: ");
scanf("%d",&value);
result=binarysearch(arr,value,10);
if(result==-1)
printf("\nNot Found ...");
else
printf("\nFound at position %d", result);
}
Element are:
2 3 5 6 8 9 10 12 15 17
Enter a no. to Search: 12
Found at position 7
2 3 5 6 8 9 10 12 15 17
Enter a no. to Search: 12
Found at position 7
#
#Write a program to read an array of n size and display it.
#include<stdio.h>
main()
{
int n;
printf("Enter the no of element to store in the array: ");
scanf("%d",&n);
int a[n];
printf("Enter %d nos: ");
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
printf("%d ",a[i]);
}
}
Enter the no of element to store in the array: 5
Enter 5 nos: 3 6 8 2 5
3 6 8 2 5
Enter 5 nos: 3 6 8 2 5
3 6 8 2 5
#
#Write a program to read an array of n size and find sum of all elements
#include<stdio.h>
main()
{
int n,s;
printf("Enter the no of element to store in the array: ");
scanf("%d",&n);
int a[n];
printf("Enter %d nos: ");
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);
s=s+a[i];
}
printf("Sum is %d ",s);
}
Enter the no of element to store in the array: 5
Enter 5 nos: 5 6 4 2 3
Sum is 20
Enter 5 nos: 5 6 4 2 3
Sum is 20
#
#Write a program to read an array of n size and count all negative no.
#include<stdio.h>
main()
{
int n,c=0,i;
printf("Enter the no of element to store in the array: ");
scanf("%d",&n);
int a[n];
printf("Enter %d nos: ");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(a[i]<0)
c=c+1;
}
printf("Total negative nos are %d",c);
}
Enter the no of element to store in the array:
8
Enter 8 nos:
3 -8 6 3 -9 -5 1 0
Total negative nos are 3
8
Enter 8 nos:
3 -8 6 3 -9 -5 1 0
Total negative nos are 3
#
#Write a program to read an array of n size and count all even as well as odd.
#include<stdio.h>
main()
{
int n,c1=0,c2=0,i;
printf("Enter the no of element to store in the array: ");
scanf("%d",&n);
int a[n];
printf("Enter %d nos: ");
#include<stdio.h>
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(a[i]%2==0)
c1=c1+1;
else
c2=c2+1;
}
printf("Even nos are %d",c1);
printf("\nOdd nos are %d",c2);
}
Enter the no of element to store in the array:
10
Enter 10 nos:
12 3 9 6 2 8 10 1 5 4
Even nos are 6
Odd nos are 4
10
Enter 10 nos:
12 3 9 6 2 8 10 1 5 4
Even nos are 6
Odd nos are 4