Forum     

Go Back   Digit Technology Discussion Forum > Portables, Peripherals and Electronics > QnA (read only)
Register FAQ Calendar Mark Forums Read

QnA (read only) Mods please help transfer the contents of this forum to proper sections. :)


 
 
LinkBack Thread Tools Search this Thread Display Modes
Old 04-02-2006, 11:09 AM   #1 (permalink)
Right Off the Assembly Line
 
Join Date: Jul 2005
Location: coimbatore
Posts: 30
Default c program


hai,
pls any one give the program.

Design and implement an efficient algorithm to remove consecutive 1char, 2char, 3 char... so on recurrences in dictionary words.
For example, "abbabccbc" first will become "ababcbc", then become "abc". Similarly, "abcaab" will become "abcab" and but stays as it is after that. You need to output only the last string ("abc" and "abcab" for the above two examples).

bye.,
saravana.
saro_gn is offline  
Advertisements. Register and be a member of the community to get rid of them.
Advertisement

Old 04-02-2006, 03:21 PM   #2 (permalink)
Human Spambot
 
Join Date: Nov 2004
Location: Madurai
Posts: 2,349
Default

Use recursion until number of characters to be compared is more than half the length of the string...

Please dont ask others to write the program for you... Get the algorithm and work it out yourselves... That is the correct way to learn...

Arun
sakumar79 is offline  
 

Bookmarks

Thread Tools Search this Thread
Search this Thread:

Advanced Search
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are On
Pingbacks are On
Refbacks are On


 
Latest Threads
- by topgear
- by Charan

Advertisement




All times are GMT +5.5. The time now is 07:00 AM.


Powered by vBulletin® Version 3.8.7
Copyright ©2000 - 2012, vBulletin Solutions, Inc.

Search Engine Optimization by vBSEO 3.3.2