[algogeeks] Re: Simple easy to understand definition of Asymptotic Analysis

here it is: http://en.wikipedia.org/wiki/Asymptotic_analysis On Wed, May 28, 2008 at 12:27 PM, Vinodh [EMAIL PROTECTED] wrote: Hi can anyone provide a simple easy to understand definition of Asymptotic Analysis -- You can contact me by : Home page: http://www.revidev.com/halfas/

[algogeeks] inverse matrix related question.

Hi, I need a gaussian method to calculate inverse N x M matrix. Maybe anyone can suggest some hints? need to be very fast operation. Lukas. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group.

[algogeeks] Re: inverse matrix related question.

I just need fastest algorithm I can get to implement Gaussian method to calculate inverse N x M matrix. On Jan 9, 2008 3:24 AM, Dave [EMAIL PROTECTED] wrote: What is the problem you want to solve using the inverse matrix? There are many problems that can be solved much more efficiently by an

[algogeeks] Re: single circular linked list : QUESTION.

I figured that out, need just resign pointers. |_1_| - |_2_| ---del--- |_3_| -- next {1} |next--| On Nov 16, 2007 8:26 PM, Dave [EMAIL PROTECTED] wrote: If the list contains at least two nodes, simply copy the data from the next node into the current one and

[algogeeks] single circular linked list : QUESTION.

Hi, I have this *single circular linked list* structure: public class ListItem { int n; ListItem next; public ListItem() { this.n = 0; this.next = null; } public ListItem(int n, ListItem e) { this.n = n;

[algogeeks] Graph coloring algos.

I need experimentally compare RLF and DSATUR graph coloring heuristics algorithms. Maybe anyone have some information, or maybe some optimized peas of code ? :) Lukas. -- You can contact me by : Google Talk: [EMAIL PROTECTED] Skype: halfas.online.now IRC: HalFas` (irc2.omnitel.net)

[algogeeks] Re: Path finding in map

I haven't any problems, just i like to know what kinda algos use to create path finding in _city map_, how to define map data, like nodes? (x, y), street have : street start x, start y, and street end x, end y, and homes near street just nodes from street? But how then with streets whom is like

[algogeeks] Re: Hi All

greetz On 4/5/07, maverick [EMAIL PROTECTED] wrote: I'm Vikram, a new member to this group. -- You can contact me by : msn messanger: [EMAIL PROTECTED] yahoo messanger: [EMAIL PROTECTED] ICQ: 443443043 Google Talk: [EMAIL PROTECTED] Skype: halfas.online.now IRC:

[algogeeks] Re: ALGORITHMS

thanks, any one have more sugestions? On 12/12/06, Vijendra Singh [EMAIL PROTECTED] wrote: try this one.. http://www.nist.gov/dads -Vijju On 11/8/06, Lukas Šalkauskas [EMAIL PROTECTED] wrote: Hi, maybe anyone knows where i can find various algorithms? like fractal trees, flocking

[algogeeks] ALGORITHMS

Hi, maybe anyone knows where i can find various algorithms? like fractal trees, flocking, and etc.-- You can contact me by : msn messanger: [EMAIL PROTECTED] yahoo messanger: [EMAIL PROTECTED] Google Talk: [EMAIL PROTECTED] Skype: halfas.online.now IRC: HalFas`(irc2.omnitel.net) Home page:

[algogeeks] Who want to participate in this task.

Hi, here is a task: http://prize.hutter1.net/who want to help me to create an algo to solve task write me. We can create a little team and divide money. -- You can contact me by : msn messanger: [EMAIL PROTECTED] yahoo messanger: [EMAIL PROTECTED] Google Talk: [EMAIL PROTECTED] Skype:

[algogeeks] Re: where to find problems?

And maybe anybody knows where I can find solutions for various game problems, like some game, connect four, lines, manjong and etc, logic, math, and puzzle games.On 06/08/06, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote: Which of these contain solutions to the problems.I am interested in a code and

[algogeeks] where to find problems?

Hi, simple question for you: where to fing various problems(programming) online. Say all sites you know.Thanks. -- You can contact me by : msn messanger: [EMAIL PROTECTED] yahoo messanger: [EMAIL PROTECTED] Google Talk: [EMAIL PROTECTED] Skype: halfas.online.now IRC: HalFas`(irc2.omnitel.net)

[algogeeks] Re: FingerPrints recognition

I know this, but how to determinate data from it and what data use for comparing here is a problem, to scan image is easy. IMHO need to use neuro algos.On 30/06/06, adak [EMAIL PROTECTED] wrote: No.But if I had to code one, I'd start with getting the program to scanthrough the image and output

[algogeeks] Re: Best way to sort linear dinamic list.

Thanks!On 4/27/06, Gene [EMAIL PROTECTED] wrote: Lukas Šalkauskas wrote: oh thats!, maybe you can give me some examples? or maybe some links with good information about it.You asked for the best way, not for code!- #include stdio.htypedef struct node

[algogeeks] Best way to sort linear dinamic list.

Hi everyone, I want to know what is the best way to sort these(as example) type of structure. example: struct Qualification { int qualif; int pay; };struct QualificationList { Qualification info; QualificationList *next; };class TQualification { private: QualificationList *Q; ...P.S.Thanks for