+1
On Sat, Jul 14, 2012 at 8:14 PM, saurabh singh saurab...@gmail.com wrote:
its from a running contest i believe.This is against the group policy as
well as against the ethics of programmers. The author of this post is
banned permanently from algogeeks. Kindly no more posts on this thread
No It will not.
For negative number, it will fail.
On Sun, Jul 15, 2012 at 11:45 PM, Tanuj Makkar
tanujmakkar.de...@gmail.comwrote:
double round(double num)
{ return (int)(num+0.5)
}
will it work all the time?
..
didnt get itcan anyone explain it.thnx in advance.
thnx amit.jst asked a stupid quesiton:)
On Mon, Jul 16, 2012 at 11:55 AM, Amit Jain aj201...@gmail.com wrote:
No It will not.
For negative number, it will fail.
On Sun, Jul 15, 2012 at 11:45 PM, Tanuj Makkar
tanujmakkar.de...@gmail.com wrote:
double round(double num)
{ return
Hello,
I am working on PHP/HTML/ XML-RPC.
I have a website, where one link shows the list of files as checkboxes and
a submit button below that.
I am stuck at point where when submit button is clicked, it has to go to
another .php page and execute whatever is there in that .php file.
Form
Hi,
You need to correct ur form tag. Try:
form name=somename id=someid method=post action=theotherfile.php
Thanks,
Vandana
On Mon, Jul 16, 2012 at 12:42 PM, Nandita Raman
nandita.rama...@gmail.comwrote:
Hello,
I am working on PHP/HTML/ XML-RPC.
I have a website, where one link shows the
connect ur form with the file you want to get redirected to by:
form method=POST action=NAME_OF_FILE.php
input type=submit/
/form
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
can you please elaborate on usage of stack to do it in O(1)?
--
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/-/8jTvBVdzsmYJ.
To post to this group, send email
yaar i can think of only 2 methods for this
1. O(nlogn) o(n) sol
traverse the heap...and hash the elements..if it exist then delete it
2.make another heap but transfering elements from 1st to 2nd heap...if the
element is equal to the last inserted element then discard it
--
You received
@Navin: A sorted array is a heap. So use the second half of a heap sort
algorithm to produce the array in sorted order. You can store the sorted
array backwards in the original array. Then reverse the array and squeeze
out the duplicates. O(n log n).
Dave
On Saturday, July 14, 2012 3:28:29
