I believe, you must have gone through the homepage of this site ;-)
http://en.wikipedia.org/wiki/algorithm
-Abhishikt
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
CFP From:
International Association of Engineers (http://www.iaeng.org)
Engineering Letters (http://www.engineeringletters.com)
International MultiConference of Engineers and Computer Scientists 2006
IMECS 2006
20-22 June, 2006, Hong Kong
http://www.iaeng.org/IMECS2006
The International
No. your definition of an algorithm is what everyone would call a
program.
A teacher can teach an algorithm in the class and then assign it to the
class.
Each of the 200 students in the class will produce a different program
(assuming no
cheating). Does that mean that there are 200 different
I am not sure about this. In my paper I restrict. All programs ---and
hence
all algorithms--- go from powers of natural numbers N^k to powers of
natural numbers N^m. So the types of the inputs and outputs are fixed.
All the best,
Noson Yanofsky
You must think about types in a more general sense that traditional
programming language types: as values that satisfy a predicate. Then
if the predicate is allowed to be a recursive function, you get your
definition.
--~--~-~--~~~---~--~~
You received this
Given a set Q of n numbers, and you want to test if more than n/2
numbers are equal. You are only allowed to compare two numbers
directly. Give an algorithm that uses O(n log n) comparisons.
--~--~-~--~~~---~--~~
You received this message because you are
n objects x1...xn, each having weight wi and profit pi, are to be
placed into a sack with capacity M. Can somebody please help me write a
algorithm that determines which objects should be placed in the sack
inorder to maximize the profit.
--~--~-~--~~~---~--~~
if there is an element occurring more than n/2 times in Q, we can find
it as following.
if x \in Q and y \in Q and x != y, we can just drop both of them and
do not change the
answer. so the algo. is like:
c = 0
for i = 1 to n {
if(c == 0) {
c = 1
x = Q_i
}else{
if(Q_i != x)
Hi all,
The code below is a strlen() procedure implemented in vc7, I tried to
understand it but failed.
I think the core of this code is its main_loop, which makes me
confused.Can anybody help me? Any hint will be appreciated.Thanks.
public strlen
strlen proc
.FPO( 0, 1, 0, 0, 0,
This is highly optimized code that in the normal case loads 4 bytes at
a time, checks if any of the 4 is z a null (0) and handles accordingly.
If the string doesn't start on a 4-byte boundary, the str_misaligned
counts 1, 2, or 3 characters until a null or alignment boundary is
found. The
A new definition of a common, well-understood, term, which is contrary
to the older definition, is simply an abomination. Words have to have
meanings that are consistent, and well understood.
So, yes. You don't know the quality of Noson's definition.
It's wrong, and it stinks.
Algorithms are
i think this link will answer ur query
http://www-cse.uta.edu/~holder/courses/cse2320/lectures/l15/node12.html
On 2/21/06, shooshweet [EMAIL PROTECTED] wrote:
n objects x1...xn, each having weight wi and profit pi, are to be
placed into a sack with capacity M. Can somebody please help me
12 matches
Mail list logo
