Yes the process is IO bound but you have to read them anyways!
Let's say you are unable to do parallel IO and thread block waits for the other
to complete , in this case as well as soon you load one chunk other is ready so
I really don't think IO is the bitch here, to me its the memory available
Hi All,
Has anyone appeared for the online test of amazon recently??
if(yes){
Please share with us :)
}
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.
nice logic :)
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/-rdIH5FKbk8J.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe
how will you find the m'th maximum element in an unsorted array of integers?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/aYU_PfGHiNkJ.
To post to this g
*
* Please send your resumes only to nick@dwlabs.*
*Thanks & Regards
Nick Smith*
*Technical Recruiter ** ***
*Dwlabs Inc*
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send emai
nick@dwlabs.*
*Thanks & Regards
Nick Smith*
*Technical Recruiter ** **
*
*Dwlabs Inc*
--
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 gro
*
*Please send your resumes only to nick@dwlabs.*
*Thanks & Regards
Nick Smith*
*Technical Recruiter ** ***
*Dwlabs Inc*
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@google
• Maintain/upgrade server/clients for Lotus Notes and Blackberry
• Provide team mentoring for Lotus/Domino/Blackberry support
**• Test/support/configure Domino server for e-mail/apps (Domino,
Blackberry, 3rd party apps)
*
*Please send your resumes only to nick@dwlabs.*
--
*Thanks & Reg
plus.
• Experience with XSLT and XML.
• Strong understanding of object-oriented (OOP) development principals and
design patterns/practices.
• Microsoft certifications are a plus.
• eCommerce, web store, order fulfillment experience a plus. *
* *
* Please send your resumes only to nick@dwlabs
Take 2 pointers at the beginning and move 1 pointer by 1 step and 2nd by 2
steps until end of listafter that position of 1st pointer will be the
mid point of a singly list...
On Wed, Sep 29, 2010 at 1:24 AM, Divesh Dixit <
dixit.coolfrog.div...@gmail.com> wrote:
> Given a singly-linked, find
Here are the steps:
Assume arrays A[n] and B[m]
- x = A[k]
- Look for value (x-1) in array B. Binary search will take O(logm)
time.
- If no such value is present then return x
- If such a value is present at index l, then return (A[k-l] > B[l]? A
[k-l] : B[l])
As you can see there is only 1 bin
Tejas Kokje wrote:
> You got confused between Binomial heap and Binary Heap.
>
> A binomial heap is a collection of Binomial trees.
>
> A binary (min)heap is a binary tree where each element is greater than
> its parent element.
>
> Check out the article on Wikipedia
>
> http://en.wikipedia.org/wi
Well, a binomial (min-)heap is a tree where the value of the parent
node is less than the value of each child node. So the smallest must be
the one at the root of the tree.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Gr
13 matches
Mail list logo
