BLM movement and protests,
The election, school shootings, and the pandemic
Answer:
O(N!), O(2N), O(N2), O(N), O(logN)
Explanation:
N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.
2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.
Rest of them should be easier.
N² is slower than N and N is slower than logN as you can check in a graphing calculator.
NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.
Answer: Software Architecture
Explanation:
Architecture of a software depicts the basic structure of a software system. Software architecture also describes how the structure of a system behaves and creates such structures, where each structure is consists of software components, relations between these components and the characteristics of these components and relations. It gives an abstraction of a system while hiding its implementation details. It provides description about how the elements of a system interact with each other. For example Service Oriented Architecture (SOA) is a software architectural approach in which the different application components provide services to other components over the network. IT is a collection of services that communicate with each other. These services integrate into distinct software systems which belong to different business domains.
