which is faster execution: loops or recursion?

3 Answers  

---

#define swap1(a,b) a=a+b;b=a-b;a=a-b; main() { int x=5,y=10; swap1(x,y); printf("%d %d\n",x,y); swap2(x,y); printf("%d %d\n",x,y); } int swap2(int a,int b) { int temp; temp=a; b=a; a=temp; return; } what are the outputs?

4 Answers   Ramco,

---

How to explain the final year project as a fresher please answer with sample project

0 Answers  

---

What is function definition in c?

0 Answers  

---

What is the equivalent code of the following statement in WHILE LOOP format?

0 Answers  

---

Is javascript based on c?

0 Answers  

---

What is the use of a static variable in c?

0 Answers  

---

how we can say java is platform independent, while we require JVM for that particular Operating System?

3 Answers   Honeywell, TCS,

---

Is c++ based on c?

0 Answers  

---

#include<stdio.h> int fun(); int i; int main() { while(i) { fun(); main(); } printf("hello \n"); return 0; } int fun() { printf("hi"); } answer is hello.how??wat is tat while(i) mean?

7 Answers   Intel,

---

How can I send mail from within a c program?

0 Answers  

---

Given a number N, product(N) is the product of the digits of N. We can then form a sequence N, product(N), product(product(N))… For example, using 99, we get the sequence 99, 99 = 81, 81 = 8. Input Format: A single integer N Output Format: A single integer which is the number of steps after which a single digit number occurs in the sequence. Sample Test Cases: Input #00: 99 Output #00: 2 Explanation: Step - 1 : 9 * 9 = 81 Step - 2 : 8 * 1 = 8 There are 2 steps to get to this single digit number. Input #01: 1137638147

2 Answers  

---