[algogeeks] Re: fatest algorithm to find suqre root of a big number of 1000 didgits

2007-08-09 Thread Alfredo Cruz
pradeep reguri wrote: > hi friends can any one help in finding square root of a big algebraic > number of 1000 digits > > > > > I think that maybe Newton method could help you... But if you want to see serious Numerical Analysis algorithms and their implementation you should check SciLab'

[algogeeks] Re: fatest algorithm to find suqre root of a big number of 1000 didgits

2007-08-09 Thread Arunachalam
For how many 1000 digits number you need to find the square root? How about implementing a program to calculate the square root based on high school maths? regards Arunachalam. On 8/9/07, pradeep reguri <[EMAIL PROTECTED]> wrote: > > > hi friends can any one help in finding square root of a big

[algogeeks] Re: Need Algorithm to return list of intermediate ranges

2007-08-09 Thread adak
I'm not sure this is oh-so elegant, but using an array: int offset = 1003; ranges[1768 - offset]. Set all values in array to 0. Iterate through the list, and mark each ranges[list value - offset] with a 1. When you've gone through the full list, go back through the ranges[] and anything with a z

[algogeeks] Re: Implementation of Dijkstra and other shortest path problems.

2007-08-09 Thread PicO
how can i use Dijkstra with heap ... how the heap can find the next unvisited element to check , as the distance is changeable every time with the minimum one ? On Jul 20, 9:36 pm, TheTravellingSalesman <[EMAIL PROTECTED]> wrote: > I'm using Java programming language and I'm trying to implement t

[algogeeks] fatest algorithm to find suqre root of a big number of 1000 didgits

2007-08-09 Thread pradeep reguri
hi friends can any one help in finding square root of a big algebraic number of 1000 digits --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@

[algogeeks] Re: What is the most efficient algorithm to find the first non repeating char in a string

2007-08-09 Thread PicO
and also if it's not alphabetic .. you can make an array of 255 ( all ASCII code ) , and it'll work also .. On Aug 8, 11:12 pm, "chitta koushik" <[EMAIL PROTECTED]> wrote: > Hi, > > If the string contains only alphabets then we can maintain an array of > 26 characters which tells that the alphabe

[algogeeks] Need Algorithm to return list of intermediate ranges

2007-08-09 Thread Tony Strazzeri
My mind is not working well at the moment and I need some help to create an algorithm to do as follows. I have jurie-rigged some working code but frankly I am embarassed to make it public. Any help with an elegant approach will be much appreciated. Cheers TonyS. I need to be able to generate a

[algogeeks] Re: What is the most efficient algorithm to find the first non repeating char in a string

2007-08-09 Thread narvi
On Aug 9, 11:45 am, Alfredo Cruz <[EMAIL PROTECTED]> wrote: > Hi, yeah, in general I think that you already know the alphabet under which > you are working. So, either you work with >ASCII codes or Unicode codes so as > Chitta said you maintain an array with your alphabet sorted by their codes