Step by Step solution about How to resolve the algorithm Sort three variables step by step in the C programming language

First Code:

The provided C code performs the following tasks:

• Input Processing: It prompts the user to enter three values (referred to as "st," "nd," and "rd" values) and stores them as strings in the character array values.

• Validity Check: It checks each input string character by character to verify if it represents a valid number. If any invalid characters (non-digit, non-period, or non-sign) are encountered, it marks isString as 1, indicating that the value(s) are strings, not numbers.

• Conversion to Double Array: If isString is 0, it converts the input strings to double-precision floating-point numbers and stores them in the val array.

• Sorting: It performs a simple sorting algorithm to order the values in either ascending order (if isString is 0) or alphabetically (if isString is 1).

• Output: It prints the values in the sorted order, with a prefix of "X" followed by a lowercase character (starting from 'a') and the sorted value.

Second Code:

The second code snippet in C demonstrates a simple sorting algorithm for three integers. It uses a do-while loop to repeatedly check and swap values until they are sorted in ascending order.

• Initialization: The code initializes three integer variables x, y, and z with values 77444, -12, and 0, respectively.

• Sorting: It enters a do-while loop that exits only when both x is less than or equal to y and y is less than or equal to z. Inside the loop, it checks and swaps values as follows:

  • If x is greater than y, it swaps x and y.
  • If z is less than y, it swaps y and z.

• Output: After sorting, it prints the sorted values of x, y, and z.

#include<string.h>
#include<stdlib.h>
#include<stdio.h>

#define MAX 3

int main()
{
  char values[MAX][100],tempStr[100];
  int i,j,isString=0;
  double val[MAX],temp;
  
  for(i=0;i<MAX;i++){
    printf("Enter %d%s value : ",i+1,(i==0)?"st":((i==1)?"nd":"rd"));
    fgets(values[i],100,stdin);
    
    for(j=0;values[i][j]!=00;j++){
      if(((values[i][j]<'0' || values[i][j]>'9') && (values[i][j]!='.' ||values[i][j]!='-'||values[i][j]!='+'))
      ||((values[i][j]=='.' ||values[i][j]=='-'||values[i][j]=='+')&&(values[i][j+1]<'0' || values[i][j+1]>'9')))
        isString = 1;
    }
  }
  
  if(isString==0){
    for(i=0;i<MAX;i++)
      val[i] = atof(values[i]);
  }
  
  for(i=0;i<MAX-1;i++){
    for(j=i+1;j<MAX;j++){
      if(isString==0 && val[i]>val[j]){
        temp = val[j];
        val[j] = val[i];
        val[i] = temp;
      }
        
      else if(values[i][0]>values[j][0]){
        strcpy(tempStr,values[j]);
        strcpy(values[j],values[i]);
        strcpy(values[i],tempStr);
      }
    }
  }
  
  for(i=0;i<MAX;i++)
    isString==1?printf("%c = %s",'X'+i,values[i]):printf("%c = %lf",'X'+i,val[i]);
  
  return 0;
}


#include<stdio.h>

int main()
{
  int x = 77444,y=-12,z=0,temp;
  
  printf("Before sorting :\nx = %d\ny = %d\nz = %d",x,y,z);
  
  do{
  temp = x;
  
  if(temp > y){
    x = y;
    y = temp;
  }
  
  if(z < y){
    temp = y;
    y = z;
    z = temp;
  }
  }while(x>y || y>z);
  
  printf("\nAfter sorting :\nx = %d\ny = %d\nz = %d",x,y,z);
  
  return 0;
}