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();
Write a simple telephone book program that stores the names and phone numbers of your friends/acquaintances in a file. Your program should have the abilities to: a. Add entries (n
Question 1 Implement a class stack which simulates the operations of the stack allowing LIFO operations. Also implement push and pop operations for the stack 2 Explain the c
A: A smart pointer is a C++ class which mimics a regular pointer in syntax and some semantics, however it does more. Since smart pointers to distinct types of objects tend to have
After p = new Fred[n], how does the compiler know about n objects to be destructed throughout delete[] p? A: The run-time system hold the number of objects, n, somewhere where
Conversion between Objects of Different Classes As the compiler does not know anything about the user-defined type, the conversion instructions are to be specified in a functio
A: #include // Test to see if pointer hopping is worthwhile. // strlen implemented with usual indexing mechanism. int strlen1( const char str[ ] ) { int i; for( i =
Program to check even and odd numbers: int main() { int your_number; cout cin >> your_number;
(i) Vilsmeir reaction
I have to make a program that allow the user input 10 numbers between 10 and 100 and if the number input is the same than the last number, should appear an error message. I have th
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.
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