WikiCards
Play on iPhone nowFree in Safari. Add it to your Home Screen.Play
WikiCards · Card list · Science cards · Analysis of algorithms
Uncommon card · Science
Analysis of algorithms, an Uncommon card
In computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms, the amount of time, storage, or other resources needed to execute them.
- Rarity
- Uncommon
- Domain
- Science
- ATK
- 67
- DEF
- 38
- Power
- 105
- Wikipedia reads a year
- 33,000
Power 105 (ATK + DEF): stronger than 60 % of WikiCards cards.
Analysis of algorithms quiz: 3 questions
Three questions on the Analysis of algorithms card, the way WikiCards duels ask them. Pick an answer, the facts are just below.
Find the missing word
An ______ is said to be efficient when this function's values are small, or grow slowly compared to a growth in the size of the input.
Answer
algorithm. An algorithm is said to be efficient when this function's values are small, or grow slowly compared to a growth in the size of the input. From the Analysis of algorithms article on Wikipedia.
Which of these cards hits hardest (highest ATK)?
Answer
Analysis of algorithms. Analysis of algorithms 67 · Bastnäsite 62 · Courtyard 59 · Circle packing 56 ATK in WikiCards.
Which of these Wikipedia articles is read the most in a year?
Answer
Analysis of algorithms. Analysis of algorithms 33,000 · Irrigation sprinkler 23,000 · Rotary converter 15,000 · Hyperbolic triangle 12,000 Wikipedia reads over a year.
In a duel, each round asks a question like these about the opposing card, with 15 seconds to answer.
The facts on the card
The card carries these facts from its Wikipedia article.
- Usually, this involves determining a function that relates the size of an algorithm's input to the number of steps it takes or the number of storage locations it uses.
- An algorithm is said to be efficient when this function's values are small, or grow slowly compared to a growth in the size of the input.
- Different inputs of the same size may cause the algorithm to have different behavior, so best, worst and average case descriptions might all be of practical interest.
Why it is Uncommon
Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Analysis of algorithms article was read about 33,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 67 and blocks with 38: each hit it takes is cut by 15 %.
How to get Analysis of algorithms
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.
More Science cards
Cards close in power
The cards just above and just below Analysis of algorithms in the power ranking, all domains together.
- American BuffaloUncommon · Science · ATK 67 DEF 38
- CourtyardUncommon · Science · ATK 59 DEF 46
- Old Tom ParrUncommon · Arts · ATK 59 DEF 46
- Arthur Guinness, Baron ArdilaunUncommon · History · ATK 63 DEF 42
- James EdwardsUncommon · Society · ATK 65 DEF 40
- Northern ThailandUncommon · Society · ATK 66 DEF 39
Card lists
- Wikipedia quizNew questions every day
- All cards from A to ZEvery card, by name
- Science cards
- Legendary cards
- Tier listS and A tiers by power (ATK + DEF)
Credits
Text : Wikipedia, Analysis of algorithms (revision), CC BY-SA 4.0. Photo : Cmglee, CC BY-SA 4.0, Wikimedia Commons.
