Answer Posted / newpolaris

bool IsInStr(char ch, const std::string& B)
{
return std::string::npos != B.find(ch);
}

// act fuction
std::string remove_same_char(const std::string& A, const
std::string& B)
{
typedef std::string::const_iterator cstr_const_it;
cstr_const_it iCSTR = A.begin();

// FOR OPTIMIZATION NRVO IS NEEDED
// ? IS POSSIBLE?
std::string _rt;

while ( iCSTR != A.end() )
{
if (!IsInStr(*iCSTR,B)) _rt+=*iCSTR;

iCSTR++;
}

return _rt;
}

int main()
{
std::string x = "hello";
const std::string y = "open";
x = remove_same_char(x, y);
}

program for insertion ,deletion,sorting in double link list

2635

---

What is multilevel inheritance?

1152

---

Why is abstraction used?

1027

---

What is oops?what is its use in software engineering?

975

---

How do you define a class in oop?

1059

---

What is polymorphism what are the different types of polymorphism?

947

---

What is a superclass in oop?

1109

---

What are two types of polymorphism?

1013

---

Can we create object of abstract class?

1029

---

#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

2493

---

What is class and object with example?

1057

---

Will I be able to get a picture in D drive to the c++ program? If so, help me out?

2139

---

What are the three parts of a simple empty class?

1979

---

What is encapsulation in oop?

987

---

Can bst contain duplicates?

1142

---