Can we find any alg. which runs faster than O(n^2) using these 2 axioms ?
2011/8/10 Amethy hobby news...@gmail.com
it also like Pythagorean theorem;
so the a[k] also with the value where
a[j]-a[i]a[k]a[i]+a[j]
and a[k]a[j]=a[i];
On 8月9日, 下午10时43分, Samba Ganapavarapu sambasiv...@gmail.com
We have an array of integers, we need to find the element a[i],a[j] and a[k]
values where.. a[i]^2 + a[k]^2 = a[k] ^2
what would be the fast algorithm to find ?
- Samba
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
://www.cprogramming.com/tutorial/bitwise_operators.html
Shashank Jain
IIIrd year
Computer Engineering
Delhi College of Engineering
On Thu, Aug 4, 2011 at 1:35 AM, Samba Ganapavarapu
sambasiv...@gmail.comwrote:
thanks raj,
is this the bitwise operator tutorial
Merget Sort sorts O(n log n) time,
Counting sort, Radix sort sorts in O (n) time...
On Thu, Aug 4, 2011 at 1:40 PM, Rohit jalan jalanha...@gmail.com wrote:
Merge Sort
On Thu, Aug 4, 2011 at 11:09 PM, parag khanna khanna.para...@gmail.comwrote:
Which is fastest sorting method?
--
You
thanks raj,
is this the bitwise operator tutorial that you told about ?
http://www.topcoder.com/tc?module=Staticd1=tutorialsd2=bitManipulation
On Wed, Aug 3, 2011 at 3:48 PM, raj kumar megamonste...@gmail.com wrote:
the best way to identify recursion is when finding solution to a
Step 1
Find the max element position in the array. ( save position maxElement
variable ).
This takes O (n)
Step 2
Find the max element position again ( this time exclude maxElement,
(maxElement+1) and (maxElement-1) in the comparision ) save this position to
secondElementRequired variable
This
, Aug 1, 2011 at 5:56 PM, Samba Ganapavarapu
sambasiv...@gmail.comwrote:
Step 1
Find the max element position in the array. ( save position maxElement
variable ).
This takes O (n)
Step 2
Find the max element position again ( this time exclude maxElement,
(maxElement+1) and (maxElement-1
@Diniz I guess they asked to do in inplace ( with no extra array )
On Mon, Aug 1, 2011 at 2:41 PM, Douglas Diniz dgdi...@gmail.com wrote:
This is a simple merge, so what is the trick? Did you forget something?
On Mon, Aug 1, 2011 at 3:19 PM, Gary Drocella gdroc...@gmail.com wrote:
Here is
