Jump to content

  • Log In with Google      Sign In   
  • Create Account


String


Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.

  • This topic is locked This topic is locked
5 replies to this topic

#1 chrispitt   Banned   -  Reputation: 34

Like
-4Likes
Like

Posted 03 May 2013 - 01:18 AM

Write a method which will remove any given character from string?



Sponsor:

#2 Ectara   Crossbones+   -  Reputation: 2872

Like
3Likes
Like

Posted 03 May 2013 - 01:34 AM

We cannot do your homework for you. However, if you provide what you have so far, and explain where you are having trouble, we would be happy to help.



#3 unbird   Crossbones+   -  Reputation: 4968

Like
0Likes
Like

Posted 03 May 2013 - 04:23 AM

Even lmgtfy has grown old. Really, this very question gives me perfect first hit.

Edited by unbird, 03 May 2013 - 04:25 AM.


#4 dave j   Members   -  Reputation: 587

Like
0Likes
Like

Posted 03 May 2013 - 04:33 AM

We cannot do your homework for you. However, if you provide what you have so far, and explain where you are having trouble, we would be happy to help.


Yes we can - we can give them wrong answers. :) Maybe then they'll attempt to do their homework for themselves.

#5 Khatharr   Crossbones+   -  Reputation: 2913

Like
0Likes
Like

Posted 03 May 2013 - 07:56 PM

Well, the correct answer is, "No."

Does that help?
void hurrrrrrrr() {__asm sub [ebp+4],5;}

There are ten kinds of people in this world: those who understand binary and those who don't.

#6 Bacterius   Crossbones+   -  Reputation: 8278

Like
2Likes
Like

Posted 03 May 2013 - 08:35 PM

You didn't even specify the language, lol. But here is a template for you:

 

 

/* insert return type here */ stripChar(/* insert params here */)
{
    /* insert code here */
}

The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.

 

- Pessimal Algorithms and Simplexity Analysis





Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.



PARTNERS