Time complexity, an Uncommon card

The card carries these facts from its Wikipedia article.

• Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform.
• Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor.
• Since an algorithm's running time may vary among different inputs of the same size, one commonly considers the worst-case time complexity, which is the maximum amount of time required for inputs of a given size.

Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Time complexity article was read about 120,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 74 and blocks with 51: each hit it takes is cut by 20 %.

Open packs. Each pack holds five cards drawn from real Wikipedia articles, the rarest last, and the fifth card is always Rare or better. The odds are shown in the game. A free pack arrives every hour and two can wait, and the Coins you win in duels buy more packs.

The cards just above and just below Time complexity in the power ranking, all domains together.