WGU |\C949 |\Data |\Structures |\and |\
Algorithms |\questions |\with |\answers
A |\functions |\whose |\cost |\scales |\linearly |\with |\the |\size |\of |\the |\input
O(n)
Iterating |\over |\a |\collection |\of |\data |\once |\often |\indicates |\an |\______ |\
algorithm. |\(alphabet |\for-loop |\example)
O(n)
A |\functions |\whose |\cost |\scales |\logarithmically |\with |\the |\input |\size
O(log |\n)
Which |\type |\of |\function |\works |\by |\breaking |\down |\large |\problem |\
into |\smaller |\and |\smaller |\chunks?
O(log |\n)
As |\the |\size |\of |\the |\input |\grows |\the |\cost |\of |\the |\algorithm |\does |\not |\
increase |\at |\the |\same |\rate. |\The |\overall |\cost |\of |\performing |\an |\
operation |\on |\1,000,000 |\items |\is |\only |\twice |\that |\of |\performing |\the
|\operation |\on |\1,000 |\items.
O(log |\n)
A |\function |\that |\exhibits |\quadratic |\growth |\relative |\to |\the |\input |\
size
O(n^2)
An |\example |\of |\this |\type |\of |\function |\is |\doubly |\nested |\loop
O(n^2)
Which |\type |\of |\function |\gets |\really |\expensive |\really |\quickly?
O(n^2)
