Alghorithm: Complessity and Correcting.
From: FlicK (zeldino_at_hotmail.com)
Date: 05/18/04
- Next message: David C. Ullrich: "Re: Panu Raatikainen's review of two of Chaitin's books."
- Previous message: Daryl McCullough: "Re: Panu Raatikainen's review of two of Chaitin's books."
- Next in thread: Rick Decker: "Re: Alghorithm: Complessity and Correcting."
- Reply: Rick Decker: "Re: Alghorithm: Complessity and Correcting."
- Reply: Kent Paul Dolan: "Re: Alghorithm: Complessity and Correcting."
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Tue, 18 May 2004 15:55:38 GMT
Hi, I look for particularly study of the complexity and the
correctness of the algorithms:
The Max's search, Search of prime number and all the algorithms of
arrangement (Selection Sort, Insertion Sort, Merge Sort) Vector Heap
(tails of priority, insertion, sort, extraction of the maximum one)
sequential Search of an element in an array, binary Trees (Bin Search,
insertion, cancellation, arrangement of a knot, rotation of balancing
of the tree), grafi (visits in ampleness and in depth, lists of
nearness and insertion and determination inside the grafo).
- Next message: David C. Ullrich: "Re: Panu Raatikainen's review of two of Chaitin's books."
- Previous message: Daryl McCullough: "Re: Panu Raatikainen's review of two of Chaitin's books."
- Next in thread: Rick Decker: "Re: Alghorithm: Complessity and Correcting."
- Reply: Rick Decker: "Re: Alghorithm: Complessity and Correcting."
- Reply: Kent Paul Dolan: "Re: Alghorithm: Complessity and Correcting."
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|