Assignment 7 Question 1

-
#include <stdio.h>
struct details{
char name[128];
int p,c,m;
};
int main()
{
int i,j,n;
scanf("%d", &n);
struct details a[n];
for(i=0;i<n;i++)
{
scanf("%s %d %d %d", a[i].name,&a[i].p,&a[i].c,&a[i].m);
}
struct details temp;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(j+1==n){
break;
}
if(a[j].p>a[j+1].p)
{
temp=a[j+1];
a[j+1]=a[j];
a[j]=temp;
}else if(a[j].p==a[j+1].p)
{
if(a[j].c>a[j+1].c)
{
temp=a[j+1];
a[j+1]=a[j];
a[j]=temp;
}else if(a[j].c==a[j+1].c)
{
if(a[j].m>a[j+1].m)
{
temp=a[j+1];
a[j+1]=a[j];
a[j]=temp;
}
}
}
}
}
for(i=0;i<n;i++)
{
printf("%s-%d-%d-%d\n", a[i].name,a[i].p,a[i].c,a[i].m);
}
return 0;
}

Comments

Post a Comment

Popular posts from this blog

Assignment 8 Question 1

-
#include <stdio.h> #include <stdlib.h> struct DoublyLinkedList{ int data; struct DoublyLinkedList *prev; struct DoublyLinkedList *next; }; void removeNode ( struct DoublyLinkedList **headptr, struct DoublyLinkedList **tailptr, struct DoublyLinkedList *ptr) { if ( ptr == *headptr ){ *headptr = ptr->next; (*headptr)->prev = NULL; }else{ if ( ptr == *tailptr ) { *tailptr = ptr->prev; (*tailptr)->next=NULL; }else{ ptr->prev->next = ptr->next; ptr->next->prev = ptr->prev; } } free ( ptr ); ptr = NULL; return; } void removeData ( struct DoublyLinkedList **headptr, struct DoublyLinkedList **tailptr, int n) { struct DoublyLinkedList *curr; curr = *headptr; while ( curr != NULL && curr->data != n ){ curr = curr->next; } if ( curr != NULL ){ removeNode(headptr, tailptr, curr); } return; } struct DoublyLinkedList *createNode(int n) {
Read more

Assignment 7 Question 2

-
#include <stdio.h> #include <stdlib.h> struct node {     int data;     struct node *next; }; typedef struct node NODE; int main() {     NODE *head=NULL;     NODE *tail=NULL;     int a,n;     scanf("%d",&a);     while(a!=-1)     {         NODE *s;         s=(NODE *)malloc(sizeof(NODE));         s->data=a;         s->next=NULL;         if(head==NULL)         {              head=s;              tail=s;         }         else         {             tail->next=s;             tail=s;         }         scanf("%d",&a);     }     scanf("%d",&n);     struct node *temp=head;     int count=0;     while(temp!=NULL)     {         count++;         temp=temp->next;     }     int l=count-n;     if(l<0)     {         printf("-1");     }     else     {         while(l!=0)         {             head=head->next;             l--;         }          temp=head;  
Read more

Assignment 6 Question 2

-
#include <stdio.h> #define MAX 100 int main() { char str1[MAX]; scanf("%s", &*str1); int i=0; int count1=0; int high=1; for(i=0;i<MAX;i++)   {    if(str1[i]==str1[i+1])    {     count1++;    }else{     if(count1>high)     {    high=count1; }     count1=1;        }    if(str1[i]=='\0')    {     break;    }   }     printf("%d", high); return 0; }
Read more