Answer Posted / indira

We have to use Linear Search only when elms r in random or
mixed .
In order to use Binary Search u have to sort these elems
whose order of complexity is n2.
so its better to use linear search whose complexity is of o(n)

What is polymorphism oop?

1068

---

Why do we use encapsulation in oops?

1043

---

What is difference between pop and oop?

1171

---

is there any choice in opting subjects like 4 out of 7

2193

---

Why oops is important?

1127

---

What is the advantage of oop over procedural language?

1090

---

Prepare me a program for the animation of train

2478

---

Why polymorphism is used in oops?

1054

---

What is methods in oop?

982

---

What is destructor give example?

1058

---

What is pointer in oop?

1061

---

What do you mean by variable?

1041

---

What are constructors in oop?

1185

---

write a C++ program for booking using constructor and destructor.

2547

---

#include #include #include #include void select(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); select(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void select(char *items, int count) { register int a, b, c; int exchange; char t; for(a = 0; a < count-1; ++a) { exchange = 0; c = a; t = items[ a ]; for(b = a + 1; b < count; ++b) { if(items[ b ] < t) { c = b; t = items[ b ]; exchange = 1; } } if(exchange) { items[ c ] = items[ a ]; items[ a ] = t; } } } design an algorithm for Selection Sort

2554

---