Answer:
By Using the Greedy- Activity- Selection algorithm
Explanation:
The Greedy- Activity- Selection algorithm in this case involves
First finding a maximum size set S1, of compatible activities from S for the first lecture hall.
Then using it again to find a maximum size set S2 of compatible activities from S - S1 for the second hall.
This is repeated till all the activities are assigned.
It requires θ(n2) time in its worse .
My idea on creating a new and fresh Gaming experience around viewing occasions is that one should incorporate emotions into games that people around around viewing occasions can feel.
<h3>What is a gaming experience?</h3>
Gaming is known to be that experience or one can say the origin of identity and also the community that is made for gamers.
Note that the experience is one that goes far more than the game itself, and as such, My idea on creating a new and fresh Gaming experience around viewing occasions is that one should incorporate emotions into games that people around around viewing occasions can feel.
Learn more about Gaming experience from
brainly.com/question/27355039
#SPJ1
Answer: i believe a digital citizen
i am not 100% sure about that answer but i reaserached a little and thats what i found :)
I hope this helps u out a little a thank and a brainlist would be greatly appreciatecd :)
Answer:
144°
Explanation:
The sum of the measures of interior angles of a quadrilateral is 360°
The ratio of angle measures is 1:2:3:4
Total ratio = 1+2+3+4=10
The angles will be :
1/10 * 360°= 36°
2/10*360°=72°
3/10*360°=108°
4/10*360°=144°
The largest angle is 144°
Linear search
You implement this algorithm by iterating over each item, and checking if the item matches what you are searching for.
It is linear because it takes a linear amount of time to search for an item.
