Re: [algogeeks] OS question..
I think the answer to Q1 may Yes. Cause the virtual memory of program is limited, they need logically contiguous memory, and have limit from OS and processor(32-bit, or 64-bit) yet. I have no idea about Q2. On Mon, Nov 5, 2012 at 4:30 AM, manish narayan.shiv...@gmail.com wrote: Q1. If we have infinite memory, then do we still be needing paging? Q2. Given only 8bits registers, you have to find average of 4 bit registers values without using any operation involving 16 bit calculations. -- 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/-/iUT57I-DOHoJ. 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, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] inplace_merge() implementation
The inplace_merge() function is similar to the merge() function, but instead of creating a new sorted range of elements, inplace_merge() alters the existing ranges to perform the merge in-place. --- cppreference.com On Thu, Oct 11, 2012 at 4:02 PM, Amitesh Singh singh.amit...@gmail.comwrote: Hi, Just wondering if anybody know the implementation of inplace_merge() defined in C++/STL (algorithm ? Source: http://www.cplusplus.com/reference/algorithm/inplace_merge/ Thanks -- Amitesh -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] inplace_merge() implementation
Hi, Amitesh. Forgive me omitted your implementation word. As I know inplace_merge(), it is do malloc buffer memory to implement the similar as merge(). But it will divide and conquer, when available buffer is too small. (I guess this will be what you wanna to know.) You can open every STL source code(gcc, STLport or VC) find the implementation at algorithm have fun. :) btw: http://stackoverflow.com/questions/438012/stl-merge-without-buffer-algorithm this page may got some help. On Thu, Oct 11, 2012 at 6:23 PM, Amitesh Singh singh.amit...@gmail.comwrote: Thanks for the reply. Yes. I know that. Can you please provide a working code? C or C++ Regards -- Amitesh On Thu, Oct 11, 2012 at 2:47 PM, Hanlei Qin qinhan...@gmail.com wrote: The inplace_merge() function is similar to the merge() function, but instead of creating a new sorted range of elements, inplace_merge() alters the existing ranges to perform the merge in-place. --- cppreference.com On Thu, Oct 11, 2012 at 4:02 PM, Amitesh Singh singh.amit...@gmail.comwrote: Hi, Just wondering if anybody know the implementation of inplace_merge() defined in C++/STL (algorithm ? Source: http://www.cplusplus.com/reference/algorithm/inplace_merge/ Thanks -- Amitesh -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: bfs
use STL map is works, but I recommended the unordered_map it is in C++11 standard implement by hashing, you can try. On Sat, Aug 11, 2012 at 5:49 AM, tendua bharat.kra...@gmail.com wrote: If nodes are numbered then simply make a boolean array and make the corresponding element true after visiting the node. If nodes are string then go for hashing. In Java you can use HashMap otherwise it'll take a little more effort to implement it. -- 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/-/LDKW1vbjHN0J. 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, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] A SIMPLE C++ PROGRAM.
*I can't explain it.* * * This code is evil, never coding like this. It's relate to specific C++ compiler implement. That's all my know about it. This my first post at googlegroups. Hello everyone. :) On Fri, Apr 29, 2011 at 4:31 PM, MANNU manishkr2...@gmail.com wrote: *Can anyone please explain me the output of this program:* int x=1; int y=x++ + ++x + ++x + x++; couty; coutx; -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] A SIMPLE C++ PROGRAM.
Manish is right. I'm so sorry, the evil code what I said before is uglier as follows int x=1; int y=x++ + ++x + ++x - x++; couty; Forgive my careless please...:( On Fri, Apr 29, 2011 at 4:31 PM, MANNU manishkr2...@gmail.com wrote: *Can anyone please explain me the output of this program:* int x=1; int y=x++ + ++x + ++x + x++; couty; coutx; -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- 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, visit this group at http://groups.google.com/group/algogeeks?hl=en.
