WikiCards
Play on iPhone nowFree in Safari. Add it to your Home Screen.Play
WikiCards · Card list · Science cards · Search algorithm
Uncommon card · Science
Search algorithm, an Uncommon card
In computer science, a search algorithm is an algorithm designed to solve a search problem.
- Rarity
- Uncommon
- Domain
- Science
- ATK
- 57
- DEF
- 26
- Power
- 83
- Wikipedia reads a year
- 32,000
Power 83 (ATK + DEF): stronger than 25 % of WikiCards cards.
Search algorithm quiz: 3 questions
Three questions on the Search algorithm card, the way WikiCards duels ask them. Pick an answer, the facts are just below.
Find the missing word
Although search engines use search algorithms, they belong to the study of ______ retrieval, not algorithmics.
Answer
information. Although search engines use search algorithms, they belong to the study of information retrieval, not algorithmics. From the Search algorithm article on Wikipedia.
Which of these cards hits hardest (highest ATK)?
Answer
Search algorithm. Search algorithm 57 · Congenital amputation 54 · Step function 51 · Malda division 48 ATK in WikiCards.
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.
- Search algorithms work to retrieve information stored within a particular data structure, or calculated in the search space of a problem domain, with either discrete or continuous values.
- Although search engines use search algorithms, they belong to the study of information retrieval, not algorithmics.
- The appropriate search algorithm to use often depends on the data structure being searched, and may also include prior knowledge about the data.
Why it is Uncommon
Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Search algorithm article was read about 32,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 57 and blocks with 26: each hit it takes is cut by 10 %.
How to get Search algorithm
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 Search algorithm in the power ranking, all domains together.
- Opera buffaUncommon · Nature · ATK 56 DEF 27
- 1936 French legislative electionUncommon · History · ATK 50 DEF 33
- Ruslan PonomariovUncommon · Society · ATK 57 DEF 26
- Simone GiannelliUncommon · Society · ATK 61 DEF 22
- Chlorophytum borivilianumUncommon · Nature · ATK 45 DEF 38
- Jean FroissartUncommon · Science · ATK 56 DEF 27
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, Search algorithm (revision), CC BY-SA 4.0. Photo : Jorge Stolfi, CC BY-SA 3.0, Wikimedia Commons.
