Tilted Forum Project Discussion Community

Tilted Forum Project Discussion Community (https://thetfp.com/tfp/)
-   Tilted Technology (https://thetfp.com/tfp/tilted-technology/)
-   -   [Java] Double Oh Notion (https://thetfp.com/tfp/tilted-technology/42682-java-double-oh-notion.html)

feelgood 01-23-2004 08:20 AM

[Java] Double Oh Notion
 
I don't have a friggin clue as to what they actually mean. I'm in the middle of writing my program which is suppose to play musical tunes but I have to create an algorithms to calculate the concert frequency using the double oh notion. Does anybody have a webpage references that would be useful? The sun java website doesn't say much...

blandarfleck 01-24-2004 05:19 AM

Well, they could mean using UML notation, but could also mean Warnier-Orr (or others?) Is this a class project or work assignment? Check out http://members.aol.com/kaizensepg/oo_link.htm, it has a lot of OO Notation links.

feelgood 01-25-2004 02:00 PM

It's not really a class work project. I'm suppose to try to program the most effective algorithm. My textbook spoke of double oh notions when it comes to trying to define For loops as equations and somehow the equation is transformed into the oh notion. There's nothing mentioned about UML diagram or UML notation.

cheerios 01-25-2004 09:34 PM

are you sure you're not talking "big - O" notation? that's a way of representing an algorithm's efficiency...

feelgood 01-26-2004 09:02 AM

Quote:

Originally posted by cheerios
are you sure you're not talking "big - O" notation? that's a way of representing an algorithm's efficiency...
Yeah that's the one! I wasn't sure if I was talking about the same thing...

cheerios 01-26-2004 09:12 AM

Ok, big O notation actually has NOTHING to do with physical coding. What it is, is a way of representing the efficiency of an algorithm. example: if an array has n elements, and I want to write an algorithm to copy the contents of the array to a new one with size (n+1), then for very large values of n, I can do it in ~ n steps. one for each element that needs copied. so we say that algorithm has an efficiency of O(n). some alogirthms are O(n * ln(n)) or O(n^2) <-- those are SLOW. There are ways (don't ask me I'm only through ch 1 of the algorithms HW) to analyze your arrays and see what efficiency they have. I'd hit up an algorithms book & look up efficiency or algorithmic analysis and see what it has to say, if I were you. good luck :)


All times are GMT -8. The time now is 04:49 PM.

Powered by vBulletin® Version 3.8.7
Copyright ©2000 - 2026, vBulletin Solutions, Inc.
Search Engine Optimization by vBSEO 3.6.0 PL2
© 2002-2012 Tilted Forum Project


1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37