⭐️ Program to print prime numbers between 2 and given number 👇

#include<stdio.h>
int main(){
int c=2,a,d=0;
printf("Prime number between 2 and ->");
scanf("%d",&a);
for(int b=2;b<a;b++){
for(c;c<b;c++){
if(b%c==0){
d=1;}}
c=2;
if(d==0){printf("%d \n",b);}
d=0;}}

#include<stdio.h>
int main(){
int a,b,c;
printf("enter 1st number-> ");
scanf("%d",&a);
printf("enter 2nd number-> ");
scanf("%d",&b);
printf("enter your choice 1:+ 2:- 3:* 4:/ ->");
scanf("%d",&c);
switch(c){
case 1:
printf("%d + %d = %d",a,b,a+b);
break;
case 2:
printf("%d - %d = %d",a,b,a-b);
break;
case 3:
printf("%d * %d = %d",a,b,a*b);
break;
case 4:
printf("%d / %d = %d",a,b,a/b);
break;
default:
printf("invalid input");

}}

#include<stdio.h>
int main(){
for(int j=1;j<=5;j++){
for(int i=5;i>=j;i--){
printf("%d \t",i);}
printf("\n");}
return 0;
}

#include<stdio.h>
int main(){
for(int i=5;i>0;i--){
for(int j=i;j<6;j++){
printf("%d \t",j);}
printf("\n");}}

⭐️ Bubble sorting in c👇

#include<stdio.h>
void sl(int list[], int l){
int temp;
for(int a=1;a<=l-1;a++){
for( int b=1;b<=l-a;b++){
if(list[b-1]>list[b]){
temp=list[b-1];
list[b-1]=list[b];
list[b]=temp;}
}
}
}
int main(){
printf("\n creating list \n");
int list[10];
for(int c=0;c<10;c++){
printf("enter list[%d]->",c);
scanf("%d",&list[c]);
}
int l=sizeof(list)/sizeof(list[0]);
printf("\n list before sorting \n");
for (int c=0;c<l;c++){
printf("%d \t",list[c]);}
sl(list,l);
printf("\n list after sorting \n");
for (int d=0;d<l;d++){
printf("%d \t",list[d]);}
}

⭐️ Insertion sorting in c👇

#include<stdio.h>
void insort(int list[], int l){
int temp;
for(int a=1;a<=l-1;a++){
for(int b=a-1;b>=0;b--){
if(list[b]>list[b+1]){
temp=list[b];
list[b]=list[b+1];
list[b+1]=temp;}
else {break ;}
}}}
int main(){
printf("INSERTION SORTING \n Creating list \n");
int list[10];
for(int c=0;c<10;c++){
printf("enter list[%d]->",c);
scanf("%d",&list[c]);
}
int l=sizeof(list)/sizeof(list[0]);
printf("\n list before sorting \n");
for (int c=0;c<l;c++){
printf("%d \t",list[c]);}
insort(list,l);
printf("\n list after sorting \n");
for (int d=0;d<l;d++){
printf("%d \t",list[d]);}
}

⭐️ selection sorting in c👇

#include<stdio.h>
void insort(int list[], int l){
int temp,minid;
for(int a=0;a<l-1;a++){
minid=a;
for(int b=a+1;b<l;b++){
if(list[b]<list[minid]){
minid=b;}}
if(minid!=a){
temp=list[minid];
list[minid]=list[a];
list[a]=temp;}

}}
int main(){
printf("selection SORTING \n Creating list \n");
int list[10];
for(int c=0;c<10;c++){
printf("enter list[%d]->",c);
scanf("%d",&list[c]);
}
int l=sizeof(list)/sizeof(list[0]);
printf("\n list before sorting \n");
for (int c=0;c<l;c++){
printf("%d \t",list[c]);}
insort(list,l);
printf("\n list after sorting \n");
for (int d=0;d<l;d++){
printf("%d \t",list[d]);}
}

⭐️ Program to find sum of series using recursion 👇

#include<stdio.h>
int sum(int n,int a){
if(a>n){
return 0;}
else{
return(a+sum(n,a+1));}}
int main(){
printf("series ->1+2+3+...+n \n");
int n;
int a=1;
printf("enter the last element of series-> ");
scanf("%d",&n);
printf("\n Ans is %d",sum(n,a));
}

⭐️ program to check palindrome 👇