Histogram

-
#include<stdio.h>

int main()
{
int a[]={1,2,1,3,5,4,3,2,1,2,3,1,4,5,3,2,1,6,5,2,2,1,1};
histogram(a,23);
return 0;
}

int histogram(int a[],int n){

int i,j,k=0,l,m=0,count[25]={0},max=0;

for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(a[i]==a[j]) count[i]++; //counting the occurance of each element in the array

}
int flag=0;
for(j=0;j<i;j++)
if(a[i]==a[j]) flag=1; // removing redundant element
//====================displaying histogram1===================*/
if(!flag)
{
a[m]=a[i];
count[m]=count[i];
max=max<count[m]?count[m]:max;
m++;
printf("%d %d ",a[i],count[i]);
for(k=0;k<count[i];k++) printf("*");
printf("\n");
}
}
printf("=================displaying histogram2==================\n");
for(i=0;i<m;i++)
{
for(l=0;l<max-count[i];l++) printf("\t");
for(j=0;j<count[i];j++) printf("*\t");
printf(" %d\t%d\n",count[i],a[i]);
}
printf("====================displaying histogram3=================\n");
for(i=0;i<max;i++){
for(j=0;j<m;j++){
if(i>=(max-count[j])) printf("*\t");
         else printf("\t");
}
printf("\n");


}
for(j=0;j<m;j++) printf("%d\t",count[j]);printf("\n");
for(j=0;j<m;j++) printf("%d\t",a[j]);printf("\n");
printf("====================displaying histogram4=================\n");
for(j=0;j<m;j++) printf("%d\t",a[j]);printf("\n");
for(j=0;j<m;j++) printf("%d\t",count[j]);printf("\n");
for(i=0;i<max;i++){
for(j=0;j<m;j++){
if(i<(count[j])) printf("*\t");
         else printf("\t");
}
printf("\n");
}

return 0;
}

Output:

1 7 *******
2 6 ******
3 4 ****
5 3 ***
4 2 **
6 1 *
=================displaying histogram2==================
* * * * * * * 7 1
* * * * * * 6 2
* * * * 4 3
* * * 3 5
* * 2 4
* 1 6
====================displaying histogram3=================
*
* *
* *
* * *
* * * *
* * * * *
* * * * * *
7 6 4 3 2 1
1 2 3 5 4 6
====================displaying histogram4=================
1 2 3 5 4 6
7 6 4 3 2 1
* * * * * *
* * * * *
* * * *
* * *
* *
* *
*

Popular posts from this blog

8 Bit Plane Slicing of an image in Image Processing

-
Image
%================ Bit Plane Slicing Program =================% A=imread('bit_plane_img.tif'); subplot(3,3,1),imshow(A),title('INPUT IMAGE'); for i=1:8     B=bitplaneslicing(A,i);     subplot(3,3,i+1),imshow(B),title(i); end %====================================================% %================ Bit Plane Slicing Function =================% function [ B ] = bitplaneslicing( A ,n) % function for n bit plane slicing where n<=8 [M,N]=size(A); B=zeros(M,N); for i = 1:M     for j = 1:N         str=dec2bin(A(i,j),8);         if strcmp(str(9-n),'0')             B(i,j)=0;         else             B(i,j)=2^(n-1);         end     end end end %====================================================% Input Image: bit_plane_img.tif Output Image:
Read more

Code to upload multiple files simultaneously using JSP, Servlet .

-
Image
Step 1 : Create a jsp page. index.jsp <%--      Document   : index     Created on : 21 Sep, 2013, 5:58:32 PM     Author     : snlkjha --%> <%@page contentType="text/html" pageEncoding="UTF-8"%> <!DOCTYPE html> <html>     <head>         <meta http-equiv="Content-Type" content="text/html; charset=UTF-8">         <title>JSP Page</title>     </head>     <body>         <form action="UploadServlet" method="post" enctype="multipart/form-data">             <input type="file" id="file" name="file1" accept="image/*"  multiple="muliple" required/><br>             <input type="submit"/>            <br><br> ${requestScope.message} ...
Read more

STRING PALINDROME USING STACK AND QUEUE

-
#include<stdio.h> #include<stdlib.h> #include<string.h> void push(char ); char pop(); void nq(char ); char dq(); typedef struct list {     char data;     struct list *next; }node; node *top=NULL,*front=NULL,*rear=NULL; int main() {     char word[20];     printf("Type the Word:");     scanf("%s",word);     int length=strlen(word),i=0;     while(word[i]!='\0')     {         push(word[i]);         nq(word[i]);         i++;     }     for(i=0;i<length;i++)     {         if(pop()!=dq())         break;             }     if(i==length)        ...
Read more