Ur Solution is an application of Depth First Search that searches all the
elemnts od the matrix in a recursive manner :)

On Tue, Dec 20, 2011 at 11:48 AM, rahul raghavendra <[email protected]>wrote:

> there are diverse topics such as graph theory , number theory , sorting ,
>  searching , dynamic prog .  etc .
>
> u can start up with any of them ... graph theory u have bfs , dfs , prims
> , kruskals , dijkstras etc ..
> Similarly there are standard sorting algo's : quick , merge, insertion etc
> ..
>
> The important point here is , after learning the logic involved in such
> standard algo's u gotta apply them in problems .
> consut topcoder for applying such algo's .
>
>
> On Tue, Dec 20, 2011 at 11:40 AM, vivek dhiman <[email protected]>wrote:
>
>> thanks rahul.
>>
>> What are the standard algos atlease the basic one's that should be known ?
>>
>>
>> On Tue, Dec 20, 2011 at 11:33 AM, rahul raghavendra <[email protected]
>> > wrote:
>>
>>> It is always better to know certain standard algorithms.
>>> So whenever u see a problem and can possibly match it with any standard
>>> algorithm .. u r in luck and can solve it in the most efficient manner as u
>>> already know how to go about it.
>>>
>>> Whereas for the other case when u hav no idea abt the problem ,, then u
>>> gotta start thinking about the logic in a normal way.
>>>
>>> Knowing such standard algo's will also allow u to use their logic in
>>> building more complex solutions .
>>>
>>>
>>> On Tue, Dec 20, 2011 at 11:19 AM, vivek dhiman 
>>> <[email protected]>wrote:
>>>
>>>> Given that you don't know any standard algorithm but you know how do
>>>> you find out which algo will be used for any given problem?
>>>>
>>>> Thing is whenever i see any problem i start solving it without thinking
>>>> about a possible standard algo.. i want to be faster ..
>>>> can some one reply ?
>>>>
>>>>  --
>>>> You received this message because you are subscribed to the Google
>>>> Groups "Google Code Jam" group.
>>>> To post to this group, send email to [email protected].
>>>> To unsubscribe from this group, send email to
>>>> [email protected].
>>>> For more options, visit this group at
>>>> http://groups.google.com/group/google-code?hl=en.
>>>>
>>>
>>>
>>>
>>> --
>>> *
>>> K.Rahul  :)
>>> VII Semester
>>> Information Science
>>> PESIT , Bangalore
>>>
>>> *
>>>
>>> --
>>> You received this message because you are subscribed to the Google
>>> Groups "Google Code Jam" group.
>>> To post to this group, send email to [email protected].
>>> To unsubscribe from this group, send email to
>>> [email protected].
>>> For more options, visit this group at
>>> http://groups.google.com/group/google-code?hl=en.
>>>
>>
>>
>>
>> --
>> Regards
>> Vivek Dhiman
>>
>>  --
>> You received this message because you are subscribed to the Google Groups
>> "Google Code Jam" group.
>> To post to this group, send email to [email protected].
>> To unsubscribe from this group, send email to
>> [email protected].
>> For more options, visit this group at
>> http://groups.google.com/group/google-code?hl=en.
>>
>
>
>
> --
> *
> K.Rahul  :)
> VII Semester
> Information Science
> PESIT , Bangalore
>
> *
>



-- 
*
K.Rahul  :)
VII Semester
Information Science
PESIT , Bangalore

*

-- 
You received this message because you are subscribed to the Google Groups 
"Google Code Jam" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to 
[email protected].
For more options, visit this group at 
http://groups.google.com/group/google-code?hl=en.

Reply via email to