you can use RMI registry
--
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 email to
algogeeks+unsubscr...@googlegroups.com.
For more options,
Hi Raghav,
I dont have much idea about the organisation. I gave a look at the idea
page while searching for an organisation to work for, and this is what I
could figure out.
The work you need to do for app inventor for GSoC is not android
application development. App inventor is for ones who
I am considering that I am having total size of buffer that is maximum of
output or input buffer and input is given in the buffer.
My first approach of the solution was that
1. first traverse whole array and then count total number of characters
that will be present in whole array. O(n)
2. fill
what if we simply use the same char instead of '\0' that would reduce one
traversal?
(@utkarsh We discussed that earlier in lab.Did u found out the bug in this
approach?)
Saurabh Singh
B.Tech (Computer Science)
MNNIT
blog:geekinessthecoolway.blogspot.com
On Fri, Mar 23, 2012 at 6:38 PM, UTKARSH
yes if we use char instead of that place then again we will loss the data
on the input a1b1c4
On Fri, Mar 23, 2012 at 7:42 PM, saurabh singh saurab...@gmail.com wrote:
what if we simply use the same char instead of '\0' that would reduce one
traversal?
(@utkarsh We discussed that earlier in
Yes u are correct...My bad...That obviously didn't made any sense
Saurabh Singh
B.Tech (Computer Science)
MNNIT
blog:geekinessthecoolway.blogspot.com
On Fri, Mar 23, 2012 at 7:49 PM, UTKARSH SRIVASTAV
usrivastav...@gmail.comwrote:
yes if we use char instead of that place then again we will
Thanks..
I am trying to work with that code but there is no contact information
for that organisation( like irc channel, mailing list or facebook
page) so how could i contact them?
On 3/23/12, Sourabh Chandak sourabh3...@gmail.com wrote:
Hi Raghav,
I dont have much idea about the organisation.
@utkarsh: +1
On 23 Mar 2012 18:38, UTKARSH SRIVASTAV usrivastav...@gmail.com wrote:
I am considering that I am having total size of buffer that is maximum of
output or input buffer and input is given in the buffer.
My first approach of the solution was that
1. first traverse whole array and
Atul
a10 looks good however, when there are multiple such cases within the same
string, it is is a problem because i would not know if the char is the real
character of the string or part ofthe length
eg
a10115
is a valid string and can be interpreted as a01 or a 10115 times.
RLE is the
It is basically sorting the linked list. Do not change the first pointer of
nodes and use the second pointer for sorting. return the pointer to the
smallest element. That's it.
On Sat, Mar 24, 2012 at 12:50 AM, Atul Singh atulsingh7...@gmail.comwrote:
Given a linked list with each node having
don't know if i am complicating..assumption,
build a multimap of values and the corresponding node address as well as a
heap from the given nodes in first pass.
now from minheap pick one by one and set the second pointer of previous
picked min element to this element using multimap(remove from
@Abhishek: What sorting algorithm are you going to use?
On Mar 23, 3:02 pm, Abhishek Sharma jkabhishe...@gmail.com wrote:
It is basically sorting the linked list. Do not change the first pointer of
nodes and use the second pointer for sorting. return the pointer to the
smallest element. That's
actually, multimap can be avoided, each element of heap is key,value where
key is the element and value is address and build heap on key.
Best Regards
Ashish Goel
Think positive and find fuel in failure
+919985813081
+919966006652
On Sat, Mar 24, 2012 at 1:40 AM, Ashish Goel ashg...@gmail.com
A merge sort will be O(n*log n) and not use the extra memory required
for a heap.
Don
On Mar 23, 3:11 pm, Ashish Goel ashg...@gmail.com wrote:
actually, multimap can be avoided, each element of heap is key,value where
key is the element and value is address and build heap on key.
Best Regards
@don: inplace Mergesort can be used. Complexity would be O(nlogn).
@Ashish: Heapsort is reliable but unstable and also, slower.
On Sat, Mar 24, 2012 at 1:49 AM, Don dondod...@gmail.com wrote:
A merge sort will be O(n*log n) and not use the extra memory required
for a heap.
Don
On Mar 23,
Google Group: app-inventor-open-source-...@googlegroups.com
On Fri, Mar 23, 2012 at 9:11 PM, Raghav Garg rock.ragha...@gmail.comwrote:
Thanks..
I am trying to work with that code but there is no contact information
for that organisation( like irc channel, mailing list or facebook
page) so
I couldn't understand the meaning of *return the pointer to smallest*
Is it that that the pointer of largest node will point to smallest node.
ATul Singh | Final Year | Computer Science Engineering | NIT
Jalandhar | 9530739855
|
--
You received this message because you are subscribed to
17 matches
Mail list logo
