#include <stdio.h> #include <stdlib.h> void addBook(); void displayBook(); void deleteBook(int id); void editBook(int id); typedef struct{ int id; char title[50]; char author[50]; }Book; int main() { int option=-1; int id; do{ //system("cls"); ...

ত্রিভূজের তিন কোণের সমষ্টি ১৮০ ডিগ্রি। চতুর্ভূজের চার কোণের সমষ্টি ৩৬০ ডিগ্রী। এরূপ পঞ্চভূজ,...... একশত বাহুবিশিষ্ট বহুভূজের মোট কোণের সমষ্টি কত হবে? বহুভুজের বাহুর সংখ্যা (n) ইনপুট দেয়া হবে (n>2). কোণের সমষ্টি বের করতে হবে। #include<stdio.h> int main(){ int n; float angle...

#include<stdio.h> int main(){ int a,b; int sum; printf("Enter any two integers: "); scanf("%d%d",&a,&b); //sum = a - (-b); sum = a - ~b -1; printf("Sum of two integers: %d",sum); return 0; } Sample output: ...

Write a c program to find out sum of digit of given number Method 1: #include<stdio.h> int main(){ int num,sum=0,r; printf("Enter a number: "); scanf("%d",&num); while(num){ r=num%10; num=num/10; sum=sum+r; } printf("Sum of digit...

Subtract two integer numbers without using subtraction operator using C language #include<stdio.h> #include<conio.h> void main(){ int a,b,d; scanf("%d%d",&a,&b); d=a+~b+1; printf("%d",d); getch(); } ...

Quick sort algorithm in C Quick sort As one of the more advanced sorting algorithms, you might think that the Quicksort Algorithm is steeped in complicated theoretical background, but this is not so. Like Insertion Sort, this algorithm has a fairly simple concept at the core, but is made compl...

Heap Sort Heap sort algorithm, as the name suggests, is based on the concept of heaps. It begins by constructing a special type of binary tree, called heap, out of the set of data which is to be sorted. Note: A Heap by definition is a special type of binary tree in which each node is greater...

Insertion Sort The Insertion Sort algorithm is a commonly used algorithm. Even if you haven't been a programmer or a student of computer science, you may have used this algorithm. Try recalling how you sort a deck of cards. You start from the begining, traverse through the cards and as you f...

Selection sort algorithm in C Selection sort The idea of Selection Sort is rather simple. It basically determines the minimum (or maximum) of the list and swaps it with the element at the index where its supposed to be. The process is repeated such that the nth minimum (or maximum) element is sw...

Bubble Sort algorithm in C Bubble Sort Bubble Sort is probably one of the oldest, most easiest, straight-forward, inefficient sorting algorithms. It is the algorithm introduced as a sorting routine in most introductory courses on Algorithms. Bubble Sort works by comparing each element of the lis...