Skip to main content

PROGRAMMING FOR PROBLEM SOLVING LAB : Program 21

 Write a C program that sorts a given array of names


#include<stdio.h> 

#include<string.h> 

void main()

{

int i,j,count;

char str[25][25],temp[25]; 

//clrscr();

printf("\n How many strings u are going to enter?: \n ");

scanf("%d",&count);

printf("\n Enter Strings one by one:\n "); 

for(i=0;i<=count;i++)

gets(str[i]); 

for(i=0;i<=count;i++)

for(j=i+1;j<=count;j++)

{

if(strcmp(str[i],str[j])>0)

{

strcpy(temp,str[i]); 

strcpy(str[i],str[j]); 

strcpy(str[j],temp);

}

}

printf("\n Order of Sorted Strings:\n "); 

for(i=0;i<=count;i++)

puts(str[i]);

getch();

}

OUTPUT:
How many strings u are going to enter?: 
 6
 Enter Strings one by one:
 YAK
 BROWNEE
 ZEEBRA
 APPLE
 DUCKLING
 PATRIC
 Order of Sorted Strings:
 
APPLE
BROWNEE
DUCKLING
PATRIC
YAK
ZEEBRA

Comments

Popular posts from this blog

EAMCET and ECET Web Options Guidance For Data Science, AI and Machine Learning.

EAMCET and ECET WEB OPTIONS GUIDANCE   Data Science, AI ,Machine Learning and CSE:  These NEW courses are trending now and according to the research these courses are having  tremendous  future in coming days. All these branches are sub branches of CSE and now it became separate Technologies. For video explanation click on  click here                Branch Name                                                                      Branch code 1. CSE(Artificial Intelligence and Machine Learning)                                            CSM 2. CSE...

PROGRAMMING FOR PROBLEM SOLVING LAB : Program 19

Write a C program that uses non recursive function to search for a Key value in a given List of integers using linear search method. Algorithm: 1. 1. Start 2. 2. Read the value of n 3. 3. for i=1 to n increment in steps of 1 Read the value of ith element into array 4. 4. Read the element(x) to be searched 5. 5. search<--linear(a,n,x) 6. 6. if search equal to 0 goto step 7 otherwise goto step 8 7. 7. print unsuccessful search 8. 8. print successful search 9. 9. stop PROGRAM: #include <stdio.h> long linear_search(long a[100], long, long);  void main() { long array[100], search, i, n, position;  //clrscr(); printf("\n Entered N values:\n");  scanf("%ld", &n); printf("\n Entered %d numbers:\n", n);  for (i= 0; i < n; i++) scanf("%ld", &array[i]); printf("\n Enter number to search: \n");  scanf("%ld", &search); position = linear_search(array, n, search);  if (position == -1) printf("%l...