One solution to this problem is that :
char s[]=abracadbra;
char p[]=bca;
char temp[];
1. First Remove element b of array p from array s .
Compare b of array p with with characters of array s .
if b is not matched with characters of array s
insert those characters of
there is the same problem on the on-line judge (http://online-
judge.uva.es/p/v100/10023.html)
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Write algorithm for finding the GCD of given numbers.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this
Google is your friend.
- Original Message -
From: sumedh sakdeo
To: algogeeks@googlegroups.com
Sent: Sunday, August 12, 2007 9:37 PM
Subject: [algogeeks] Algo to get GCD of given numbers
Write algorithm for finding the GCD of given numbers.
On Aug 12, 9:54 pm, sumedh sakdeo [EMAIL PROTECTED] wrote:
well i have made this ...
·Find minimum of n numbers.
·Run loop from i=1 to minimum number
·Check if i is divisible by all the three numbers
·If yes, gcd=i
·Continue the step till you
