68 Reputation Points
Ranked #383
- Strength to Increase Rep
- +4
- Strength to Decrease Rep
- -1
100% Quality Score
- Upvotes Received
- 5
- Posts with Upvotes
- 1
- Upvoting Members
- 5
- Downvotes Received
- 0
- Posts with Downvotes
- 0
- Downvoting Members
- 0
|
I often have this situation [code] class OrientedPoint { private: Point P; Vector N; Color C; bool valid; public: //////////// Constructors ////////// OrientedPoint() {} OrientedPoint(const Point &Coord); OrientedPoint(const Point &Coord, const Vector &Normal); OrientedPoint(const Point &Coord, const Color &C); OrientedPoint(const Point &Coord, const Vector &Normal, const Color &C); [/code] where …
|
|
Re:
Time complexity
Please can anyone tell me how to calculate time complexity of following algorithm in terms of big theta l=0 for i=1 to n do for j=1 to (n*n) do for k=1 to (n*n*n) do l=l+1 thanks in advance
|