Happy Codings - Programming Code Examples

C Programming Code Examples

C > Beginners Lab Assignments Code Examples

Program to sort an array in decending order

Program to sort an array in decending order

#include <stdio.h>
#include <math.h>
void main()
{
 int i[100],j[100],temp[100];
 int a,b=1,c,i1=2,k,b2=0;
 printf("ENTER NUMBER  OF DATA  (MAXIMUM 100):");
 scanf("%d",&k);
 printf("ENTER DATA (IN INTEGER):
");
 for(a=0;a<k;a++)
 {
 printf("k=[%d]		",a+1);
 scanf("%d",&i[a]);
 }
 for(a=0,b=1;a<k,b<k;a++,b++)
 {
 if((i[b]-i[a])>0)
 {
  temp[a]=i[b];
  temp[b]=i[a];
  i[a]=temp[a];
  i[b]=temp[b];
  }
 for(c=i1;c<k;c++)
 {
 if((i[c]-i[a])>0)
 {
  temp[a]=i[c];
  temp[c]=i[a];
  i[a]=temp[a];
  i[c]=temp[c];
 }
 }
 i1++;
 }
 printf("

YOUR ARRAY IN DECENDING ORDER IS AS FOLLOWS:
 YOUR
ARRAY[%d]=	",k);
 for(b2=0;b2<k;b2++)
 {
 printf("%d	",i[b2]);
 }
 }

Perform Exception Handling for Divide by - Declare the variables a,b,c. Read the values. Inside the "try block" check the condition. (a. if(a-b!=0) then "calculate the value" of d and display.b. otherwise throw the exception. So

Code Implement various Queue Functions - C programming code to ask the user for the operations like insert, delete, display etc. According to the entered option access the respective functions. Use switch statement

Conditional Operator Check Even or Odd - C programming code to input a number and check whether number is even or odd using Conditional/Ternary operator ?:. Check even or odd numbers using conditional operator...

Assignment Operations in C++ Language - The operator "=" is an "assignment operator" in C++ and it assigns a value to the objects on the left. C++ Language provides capability to combine assignment operator with almost all

C++ Coding Prints Pascal Triangle Pattern - Rows of "Pascal's Triangle" are conventionally enumerated starting with row n = 0 at the top ('0th row'). Entries in each row are numbered from the left beginning with k=0 & are usually

Finds Path Between Two Nodes in a Graph - A C++ Program to "check and find" if the path between two nodes exists. By running "DFS" on given graph we can find out whether path exists between two nodes. Class represents a

Largest Rectangular Area in a Histogram - Get minimum of two numbers in hist[]. Get the 'middle index' from corner indexes. Get the index of minimum value in a given range of indexes. Then returns 'index' of minimum

C++ Coding Topological Sorting in Graphs - Using an adjacency matrix, displays the times at which the 'different times' at which nodes are visited and left thereby producing a linear ordering of vertices in a graph. And A graph is