Answer / nagesh r. dalave

void main()
{
char strp20];
int len=0,i=0;
printf("\nEnter a string ");
gets(str);
while(str[i]!='\0')
{
i++;
len++;
}
printf("\nReverse of given string:");
while(i>=0)
{
printf("\n %c",str[i]);
i--;
}
getch();
}

Answer / kiran

{
char temp;
for(i,j=strlen(str)-1;i<j;i++,j--)
{
temp = str[i];
str[i] = str[j];
str[j] = temp;
}
return str;
}

Answer / sunitha

/* function to reverse a charactor array */

void rev_array(char str[])
{
char c;
char *p;
p=str;
while(*p)
{
if(*p!='\0')
{
c=p;
}
p++;
}
printf("reverse array is %s\n",c);
}

What's a good way to check for "close enough" floating-point equality?

0 Answers   Celstream,

---

What is atoi and atof in c?

0 Answers  

---

in a town the percentage of men is 52 the percentage of total literacy is 48 if total percentage of literate men is 35 of the total population write a program to find the total no of the literate men and women if the population of the town is 80000

3 Answers  

---

Why c is called free form language?

0 Answers  

---

How can you tell whether two strings are the same?

0 Answers  

---

what is the differance between pass by reference and pass by value.

7 Answers   Infosys,

---

5. What kind of sorting is this: SORT (k,n) 1.[Loop on I Index] repeat thru step2 for i=1,2,........n-1 2.[For each pass,get small value] min=i; repeat for j=i+1 to N do { if K[j]<k[min] min=j; } temp=K[i];K[i]=K[min];K[min]=temp; 3.[Sorted Values will be returned] A)Bubble Sort B)Quick Sort C)Selection Sort D)Merge Sort

2 Answers   Accenture,

---

What are the advantages and disadvantages of a heap?

0 Answers  

---

what is the stackpointer

2 Answers  

---

A stack can be implemented only using array?if not what is used?

3 Answers   InterGlobal,

---

Is stack a keyword in c?

0 Answers  

---

What are data breakpoints?

3 Answers   Adobe,

---