Professional Documents
Culture Documents
Aryan Gupta Lab2
Aryan Gupta Lab2
Aryan Gupta Lab2
Program 1 –
Code –
#include<stdio.h>
for(i=0;i<n;i++)
printf("%d ",x[i]);
}
void main()
{
int x[10];
insertsort(x,10);
printf("\nInsertion Sort\n");
display(x,10);
}
Output –
Program 2 –
Code –
#include<stdio.h>
for(i=0;i<n;i++)
printf("%d ",x[i]);
}
void main()
{
int x[10];
selsort(x,10);
printf("\nSelection Sort\n");
display(x,10);
}
Output –
Home assignment –
#include <stdio.h>
struct Player {
char name[50];
int score;
};
typedef struct Player Player;
void display(Player players[], int n) {
for(int i=0; i<n; i++) {
printf("%s %d\n",players[i].name,players[i].score);
}
}
void selectionSort(Player players[], int n) {
int min;
for(int i=0;i<n-1;i++) {
min= i;
for(int j=i+1; j<n;j++) {
if(players[j].score>players[min].score)
min=j;
}
if(min!=i) {
Player temp;
temp=players[min];
players[min]=players[i];
players[i]=temp;
}
}
}
int main() {
int n;
printf("Enter number of players: ");
scanf("%d",&n);
Player players[n];
for(int i=0; i<n; i++) {
scanf("%s",&players[i].name);
scanf("%d",&players[i].score);
}
selectionSort(players, n);
printf("\nPlayers in sorted order\n");
display(players, n);
}
Output –
Code (Insertion sort) –
#include <stdio.h>
struct Player {
char name[50];
int score;
};
typedef struct Player Player;
void display(Player players[], int n) {
for(int i=0; i<n; i++) {
printf("%s %d\n",players[i].name,players[i].score);
}
}
void insertionSort(Player players[], int n) {
for(int i=1;i<n;i++) {
int j=i-1;
Player key= players[i];
while(j>=0 && players[j].score<key.score) {
players[j+1]=players[j];
j--;
}
players[j+1]=key;
}
}
int main() {
int n;
printf("Enter number of players: ");
scanf("%d",&n);
Player players[n];
for(int i=0; i<n; i++) {
scanf("%s",&players[i].name);
scanf("%d",&players[i].score);
}
insertionSort(players, n);
printf("\nPlayers in sorted order\n");
display(players, n);
}
Output –