See a problem in else if statement

Dangling else problem

-
Image
Hello, This problem comes when we use else if statement and do some mistake more describe is given below......... Dangling else problem: One of the major problem with nested if is dangling else problem. The problem arises when both outer if statement inner if statement might pair with common else statement. Thus the compiler is not able to judge to pair the else with which statement. The solution to this problem is given by the compiler that it pairs else with the recent if thus sometimes giving wrong result.                                           Hence the programmer should put early bracket wherever required. This post is may very short because my only aim was to describe this problem. Thank you, Keep supporting............. 
1 comment

What is Array in C|| Array

-
Hello friends today we are going to start new topic of c language name is ARRAY
Today, in this post i will tell describe you that what is array and where we use this? So now start this topic and friends please ask your doubts in comment if you have any kind of problem.

Array:

Array is a collection of similer type of  elements stored in continuous memory allocation.
Mean we can store only same type value in array after declare that. If we declare that or integer we can only store integer number in it,if we declare for float we can store any float number.

But we know float can store any integer value but int can't store any float value so after declare for int we will store only integer value.
If we store any digit in array it store continuously in memory so we can easily find address of any array element. When we declare any variable it store any where in memory but when we use array for declare many variable it allocate continuously in memory.

Type of array:

There are two type of array-
  • One dimensional array
  • Multi dimensional array
Many people say array are three type and some say array have two type both are correct because who say three type array they say one dimensional ,two dimensional and then multi dimensional but who say two they take two dimensional and multidimensional together.

One dimensional array:

One dimensional array only on one row. In this we use only one loop for take input.
when dimensional increase loop counts will also increase this is easy way to learn.

Declaration of one-d array:

syntax:
data type   array name  [size off array];

for ex:
int arr[100];
int sum[50];
         
                 The size of array should be know during compile time.The size of the array should be an integer value.

Initialization:

int arr[3]={1,2,3};

int arr2[ ]={3,3,4,5,2,6};

int arr3[ ]= {3,6,8};

Initialization of array we can do by using curly bracket.we have to write in equal than give every elements in bracket.

Programs(array):


write a program to read and display n numbers using an array :

#include<stdio.h>
main()
{
int i=0,n;
int arr[50];
printf("\n Enter the numbers of elements:");
scanf("%d",&n);

printf("\n Enter the elements:");
for(i=0;i<n;i++)
{
printf("\n Arr[%d]=",i);
scanf("%d",&arr[i]);
}
printf("\n The array elements are:");
for(i=0;i<n;i++)
{
printf("Arr[%d]=%d\n",i,arr[i]);
}
}


Find largest and smallest numbers in an array:

#include<stdio.h>
main()
{
int i,n,arr[20],small,temp;
int small,small_pos;
int large,large_pos;

printf("Enter the number of elements:");
scanf("%d",&n);
printf("Enter the elements:");
for(i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
small=arr[0];
small_pos=0;
large=arr[0];
large_pos=0;
for(i=1;i<n;i++)
{
if(arr[i]<small)
{
small=arr[i];
small_pos=i;
}
if(arr[i]>large)
{
large=arr[i];
large_pos=i;
}
}
printf("\n The smallest number is %d",small):
printf("\and position of small number is %d",small_pos);

printf("\n The largest number is %d",large);
printf("and position of largest number is %d",large_pos);
}

Thanks for reading.....................
Keep supporting


Comments

Post a Comment

Popular posts from this blog

Permutations of Strings hackerrank solution in C || Permutations of Strings

-
  Permutations of Strings Strings are usually ordered in lexicographical order. That means they are ordered by comparing their leftmost different characters. For example,   because  . Also   because  . If one string is an exact prefix of the other it is lexicographically smaller, e.g.,  . Given an array of strings sorted in lexicographical order, print all of its permutations in strict lexicographical order. If two permutations look the same, only print one of them. See the 'note' below for an example. Complete the function  next_permutation  which generates the permutations in the described order. For example,  . The six permutations in correct order are: ab bc cd ab cd bc bc ab cd bc cd ab cd ab bc cd bc ab Note:  There may be two or more of the same string as elements of  . For example,  . Only one instance of a permutation where all elements match should be printed. In other words, if  , the...
Read more

use of getchar and putchar

-
Hello guys today i will tell you in this post , use of putchar and getchar............                          C programming Input and output functions: Generally we use printf and scanf as input output functions respectively  but there are various functions available for input and output. Input and output for character: Reading a character: In general scanf function is can be used to input a character but instead of that we can use getchar function. syntax: variable name=getchar();                  There are some functions that are used to test a character based on some requirement - isdigit (ch): It returns a non zero when character digit is digit otherwise returns a 0 value.                                                  ...
Read more

Libraray Fine Hackerrank solution in C || Balanced Brackets Hackerrank solution in C

-
  Library Fine Your local library needs your help! Given the expected and actual return dates for a library book, create a program that calculates the fine (if any). The fee structure is as follows: If the book is returned on or before the expected return date, no fine will be charged (i.e.:  . If the book is returned after the expected return  day  but still within the same calendar month and year as the expected return date,  . If the book is returned after the expected return  month  but still within the same calendar year as the expected return date, the  . If the book is returned after the calendar  year  in which it was expected, there is a fixed fine of  . Charges are based only on the least precise measure of lateness. For example, whether a book is due January 1, 2017 or December 31, 2017, if it is returned January 1, 2018, that is a year late and the fine would be  . Function Description Complete the  libraryFine...
Read more