Hi Anupama
On Nov 28, 4:23 pm, Anupama Murthi [EMAIL PROTECTED] wrote:
Hi all,
linear time to determine cyclic strings... give a linear time algorithm to
determine if a text T is a cyclic rotation of another string T'. For eg. ARC
and CAR are cyclic rotations of each other.
Superficially
Hi James
On Nov 26, 3:52 pm, James Fang [EMAIL PROTECTED] wrote:
The negative pair value can be workarounded by normalizing the
pair to be in the [0,MAX_INT] range.
This can be achieved by adding MAX_INT/2 to the pair before
addressing the one bit in the bit map.
I don't
Hi again
On Nov 24, 8:15 pm, Sherry [EMAIL PROTECTED] wrote:
.. But how
could I predict the time taken for these sorts when I know n?
Now I understand where you are coming from.
here is my table for the bubble sort:
Time in milliseconds:
# of # Random Half-Sorted
Hi
On Nov 22, 8:26 pm, Sherry [EMAIL PROTECTED] wrote:
I know how the complexity of an algorithms is calculated, but how
would this relate to the time it takes? Let's say I have 25000 random
numbers I'd like to sort with the selection sort. Now how could I use
Big O notation to calculate
On Nov 9, 6:10 pm, Rajat Gogri [EMAIL PROTECTED] wrote:
Hello,
I was asked this question for MSFT interview.
You are given Symbols for stock ticker application,
All are 4 character , Capital letters only so min is and max is .
for example MSFT, GOOG etcetc
How will you hash
On Nov 10, 4:53 pm, MartinH [EMAIL PROTECTED] wrote:
On Nov 9, 6:10 pm, Rajat Gogri [EMAIL PROTECTED] wrote:
I was asked this question for MSFT interview.
You are given Symbols for stock ticker application,
How will you hash it???
Personally I would call above a *vector table
ploughing through the source code.
MartinH.
--~--~-~--~~~---~--~~
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 group, send
