Anonymous Quiz
17%
10
0%
0
67%
Garbage value
17%
1
Anonymous Quiz
40%
12
40%
16
20%
18
0%
20
Anonymous Quiz
40%
200
0%
Garbage value
40%
Error
20%
10
Computer Science Programming (CS) Class 11,12& beyond
⭐️ 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]);}
}
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]);}
}
Computer Science Programming (CS) Class 11,12& beyond
⭐️ 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]);}
}
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]);}
}
Computer Science Programming (CS) Class 11,12& beyond
⭐️ 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]);}
}
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]);}
}
Computer Science Programming (CS) Class 11,12& beyond
⭐️ 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));
}
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));
}
Computer Science Programming (CS) Class 11,12& beyond
⭐️ program to check palindrome 👇
Computer Science Programming (CS) Class 11,12& beyond
⭐️2D diagram using c👇
#include<stdio.h>
int main(){
int k=1;
for(int i=5;i>=0;i--){
for(int l=i;l>=1;l--){
printf(" ");
}
for(int j=1;j<=k;j++){
printf("*");
}
printf("\n");
k=k+2;
}
}
int main(){
int k=1;
for(int i=5;i>=0;i--){
for(int l=i;l>=1;l--){
printf(" ");
}
for(int j=1;j<=k;j++){
printf("*");
}
printf("\n");
k=k+2;
}
}