C Program to find whether the given year is leap or not.

C Program to find whether the given year is leap or not. Leap year is a year, which is containing one extra day, i.e 366 days. In the leap year February contains the date 29. Read more about C Programming Language . Read more Similar C ProgramsLearn C ProgrammingNumber System You can easily select the …

C Program to generate n Fibonacci terms using array declaration.

Example programs to solve the problems of Arrays in C,C Program to generate n Fibonacci terms using array declaration. Fibonacci numbers are sequence of numbers starts from 0 and 1 , continue by adding previous number.Example: 0,1,1,2,3,5,8,13,…….. Read more about C Programming Language . Read more Similar C ProgramsArray In CNumber SystemSimple C Programs You …

C Program to find whether the given character is Vowel or Consonant

C Program to find whether the given character is Vowel or Consonant. Here, we use the simple if-else statement to check the particular character is Vowel or Consonant. Read more about C Programming Language .  [gist id=”7112441″ ] Read more Similar C Programs C Strings Data Structures C Sorting You can easily select the code …

C Program for simple calculator, using switch statement

C program to simulate a simple calculator using switch statement.  The calculator should be able to perform basic arithmetic operations like addition, subtraction, multiplication, and division only on integers. Error message should be reported, if any attempt is made to divide by zero. (Using switch statement) . Read more about C Programming Language . [gist …

C Program to Sort an Array Using Bubble Sort — With Optimisation and Complexity

Bubble Sort is the simplest sorting algorithm to understand and implement. It works by repeatedly comparing adjacent elements and swapping them if they are in the wrong order. After each pass, the largest unsorted element has “bubbled up” to its correct position at the end — just like air bubbles rising to the surface of …

Binary Search in C – Iterative and Recursive with Example

Binary search in C finds a target value in a sorted array by repeatedly halving the search space. At each step it compares the target against the middle element: if they match, the search is done; if the target is smaller, discard the right half; if larger, discard the left half. This gives O(log n) …