Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
C Program for SORTING
# include stdio.h>
void main()
{
char a;
int *p;
int i,j,temp;
clrscr();
p=&i;
p++;
for(i=1;i<=5;i++)
printf("Enter the %d no.",i);
scanf("%d",&*(p+i));
}
printf("ENTER A FOR ASENDING OR D FOR DECENDING ORDER -");
scanf("%c",&a);
if(a=='a')
for(j=1;j<=5;j++)
if(*(p+i)<*(p+j))
temp=*(p+i);
*(p+i)=*(p+j);
*(p+j)=temp;
else if(a=='d')
if(*(p+i)>*(p+j))
printf("\nThe sorted no is.");
printf("\n%d",*(p+i));
getch();
Define the Logical Operators in c language? The Logical operators deals with the ways the relationships are able to connected. C has the following three logical operators
n this problem u given a board in which some of the elements are placed as shown in diagram below .each element represent a color .fill the other elements in the board such that no
Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b
Write a c++ program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points c
Explain the Bit Wise Operators? C language has distinction of supporting special operators recognized as bit wise operators for manipulation of data at bit level. These operato
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with thes
algo of stack using two queue
(a) Write a recursive procedure (digits n) that computes the number of digits in the integer n using a linear recursive process. For example, (digits 42) should return 2 and (digit
Q. Explain that how do we implement two stacks in one array A[1..n] in such a way that neither the stack overflows unless the total number of elements in both stacks together is n.
a c++ program
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd