------------------------------------------------------------------------- Given Information ------------------------------------------------------------------------- Total number of people = 165 Adult = $6 Child = $2 Total collected = $618
------------------------------------------------------------------------- Assumptions ------------------------------------------------------------------------- Let x be the number of adults and y be the number of children
------------------------------------------------------------------------- Form equations ------------------------------------------------------------------------- Total number of people x + y = 165 Total amount collected 6x + 2y = 618
------------------------------------------------------------------------- Ans: The two equations are x + y = 165 and 6x + 2y = 618 -------------------------------------------------------------------------
The question is not asking for it but if you need to solve the equation to find the answer to x and y
------------------------------------------------------------------------- Present the two equations and solve for x and y ------------------------------------------------------------------------- x + y = 165 ------------------------- (eqn 1) 6x + 2y = 618 ------------------------- (eqn 2)
(eqn 1) : x + y = 165 x = 165 - y ------------------------- substitute into (eqn 2)
------------------------------------------------------------------------- Ans: 72 adults and 93 children -------------------------------------------------------------------------
The worst case run time of Find2D is O(n²) because the worst case run time of arrayFind is O(n) and this function will be called for n rows from Find2D algorithm, hence O(n²)
.
An algorithm is said to have linear time if its worst case run time is O(n). Since it is O(n²) for Find2D, it is not a linear time algorithm
