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 STRING ADDRESS
#include stdio.h>
#include conio.h>
#include string.h>
void main()
{
char *name;
int length;
char *ch=name;
clrscr();
printf("ENTER THE STRING: ");
gets(name);
while(*ch!='\0')
printf("%c IS SORTED AT ADDRESS %u\n",*ch,ch);
ch++;
}
length=ch-name;
printf("\nLENGTH OF THE STRING IS %d\n",length);
getch();
OUTPUT :
ENTER THE STRING : KAMLESH
K IS SORTED AT ADDRESS 928
A IS SORTED AT ADDRESS 929
M IS SORTED AT ADDRESS 930
L IS SORTED AT ADDRESS 931
E IS SORTED AT ADDRESS 932
S IS SORTED AT ADDRESS 933
H IS SORTED AT ADDRESS 934
Friend function in c++: class miles; class km { float value; public : // void input(); km convert(km ,int a ) ; void output() {
how to define a array of structure
how to make a game
implement two stacks in one array A[1...n] in such a way that neither stack overflows unless the total number of elements in both stacks together is n. For this you need to produce
Develop a function to calculate sum of n even integers starting from a given even integer
How can one handle a destructor that fails?
Given an integer n and a permutation of numbers 1, 2 ... , n-1, n write a program to print the permutation that lexicographically precedes the given input permutation. If the given
I need help with virtual memory manager implementation in C
I Want a answer for solving the big M method in the topic of simplex method...
Write a Program that illustrate Command Line Parameters? main(int argc, char *argv[]) { int i; for(i = 0; i printf("arg %d: %s\n", i, argv[i]); return 0; }
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