Answer Posted / badmoon

Overloading binary operators (C++ only)

You overload a binary unary operator with either a nonstatic
member function that has one parameter, or a nonmember
function that has two parameters. Suppose a binary operator
@ is called with the statement t @ u, where t is an object
of type T, and u is an object of type U. A nonstatic member
function that overloads this operator would have the
following form:

return_type operator@(T)

A nonmember function that overloads the same operator would
have the following form:

return_type operator@(T, U)

An overloaded binary operator may return any type.

The following example overloads the * operator:

struct X {

// member binary operator
void operator*(int) { }
};

// non-member binary operator
void operator*(X, float) { }

int main() {
X x;
int y = 10;
float z = 10;

x * y;
x * z;
}

The call x * y is interpreted as x.operator*(y). The call x
* z is interpreted as operator*(x, z).

What is encapsulation c#?

1075

---

which feature are not hold visual basic of oop?

2190

---

What is the significance of classes in oop?

1144

---

Why is polymorphism important in oop?

1073

---

How Do you Code Composition and Aggregation in C++ ?

25450

---

How to improve object oriented design skills?

1011

---

Why do we need oop?

1186

---

Can a destructor be called directly?

1068

---

What is solid in oops?

1118

---

what is different between oops and c++

2535

---

What is the oops and benefits of oops programming?

970

---

Why is static class not inherited?

1101

---

What is an interface in oop?

1038

---

What are different types of JVM's? for example we use dalvik jvm for android then what about the remaining operating systems?

2126

---

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

2614

---