|
You *could* define the order classes in terms of limits — something like this:pre:O(f) := { g : N -> N | lim n->inf |g(n)/f(n)| exists and is finite }pre:O(f) := { g : N -> N | exists a : N, s : N . forall n : N . a <= n implies g(n) <= s * f(n) }People talk about big-O because, in the context of an un-analyzed problem or algorithm, analysis usually proceeds by establishing iteratively better limits on performance, rather jumping immediately to the correct order.
|
#
¿
Jan 5, 2011 01:17
|
|
|
|
| # ¿ Apr 26, 2024 12:12 |
|
|
I feel ethically compelled to note that this is a terrible time to become a lawyer.
|
|
#
¿
Jan 9, 2011 08:12
|
|
|
Computer Engineering is a very broad field; it is easily possible for two graduates with C.E. degrees from the same school to have almost completely non-intersecting sets of skills. Some schools track C.E. more in one direction than in others.
|
|
#
¿
Apr 7, 2011 21:40
|
|
|
Orzo posted:I wouldn't expect anyone who has had a real job for a number of years to remember that. If they were straight out of school, maybe. There's actually an important semantic difference; it's one of the few things that make it important to understand sorting algorithms even when you don't need to implement them.
|
|
#
¿
Aug 20, 2011 06:56
|
|
|
Technically, it can be made O(n log n) because there's a linear-time median algorithm. Nobody ever does this, though.
|
|
#
¿
Aug 21, 2011 18:19
|
|
|
Valued Member of the Train Team
|
|
#
¿
Aug 26, 2011 19:40
|
|
|
|
| # ¿ Apr 26, 2024 12:12 |
|
|
I wouldn't over-interpret "stipend"; some places just use that word for salaries paid to internships. Equity definitely means some sort of stock / ownership share, but I would treat that as worthless; it's not *insultingly* worthless, but it's definitely not something you should ever count on having value.
|
|
#
¿
Oct 3, 2011 06:13
|
|