#REDIRECT [[Binary search]]
...
27 bytes (3 words) - 06:54, 8 November 2007
...s a range of values into halves, and continues to narrow down the field of search until the unknown value is found. It is the classic example of a "divide an
...e, the ending point of a range, and the "secret value", implement a binary search through a sorted integer array for a certain number. Implementations can be
...
256 KB (32,160 words) - 19:38, 6 June 2024
#REDIRECT [[Yahoo! search interface]]
...
37 bytes (4 words) - 08:31, 1 December 2010
#REDIRECT [[Yahoo! search interface]]
...
37 bytes (4 words) - 01:43, 31 January 2011
#REDIRECT [[Yahoo! search interface]]
...
37 bytes (4 words) - 19:47, 4 February 2011
#REDIRECT [[Search a list of records]]
...
38 bytes (6 words) - 08:38, 22 August 2016
A [[wp:Word_search|word search]] puzzle typically consists of a grid of letters in which words are hidden.
There are many varieties of word search puzzles. For the task at hand we will use a rectangular grid in which the w
...
174 KB (21,146 words) - 09:16, 6 June 2024
The A* search algorithm is an extension of [[Dijkstra's algorithm]] useful for finding th
A route with the lowest cost should be found using the A* search algorithm (there are multiple optimal solutions with the same total cost).
...
215 KB (24,858 words) - 09:00, 7 April 2024
szNomSite1: .asciz "search.yahoo.com:443" // host name and port
szLibStart: .asciz ">Rosetta Code" // search string
...
148 KB (18,625 words) - 12:15, 17 February 2024
* [[Search a list of records]]
INT FUNC Search(PTR ARRAY texts INT count CHAR ARRAY text)
...
152 KB (19,992 words) - 14:20, 24 April 2024
#REDIRECT [[Boyer-Moore string search]]
...
39 bytes (4 words) - 20:25, 7 July 2022
To properly test this algorithm, it would be good to search for a string which contains repeated subsequences, such as <code>alfalfa</c
for the bad character rule in the Boyer-Moore string search algorithm, although it has
...
96 KB (13,039 words) - 18:56, 9 November 2023
|topic=Search support
|summary=Why was [[Special:Search]] disabled?
...
2 KB (275 words) - 01:32, 10 November 2010
#REDIRECT [[A* search algorithm]]
...
33 bytes (4 words) - 22:42, 18 December 2016
...the list are themselves compound records/objects/data-structures, and the search condition is more complex than a simple equality test?
! Search
...
137 KB (16,954 words) - 20:47, 4 April 2024
...h%E2%80%93Morris%E2%80%93Pratt_algorithm < About Knuth-Morris-Pratt String Search Algorithm >]
"Pattern search with KMP algorithm."
...
54 KB (6,391 words) - 11:53, 12 December 2023
<strike><nowiki>{{draft task|Search and Evaluation}}</nowiki></strike> This is a sub-task of the [[Chess player
Create a function or software component which will search the tree of moves from a given chess position up to a maximum depth and det
...
1,013 bytes (149 words) - 23:20, 27 February 2020
#REDIRECT [[Knuth-Morris-Pratt string search]]
...
46 bytes (4 words) - 20:26, 7 July 2022
#REDIRECT [[Rosetta Code:Village Pump/Search support]]
...
54 bytes (7 words) - 04:30, 21 July 2009
printf("Usage : %s <followed by search string, enclosed by \" if it contains spaces>",argV[0]);
println("Usage: type search phrase in quotes as an argument.")
...
62 KB (8,335 words) - 20:34, 11 April 2024
|topic=Search support
|summary=Why was [[Special:Search]] disabled?
...
2 KB (275 words) - 01:32, 10 November 2010
#REDIRECT [[Word search]]
...
25 bytes (3 words) - 11:46, 31 July 2016
#REDIRECT [[Binary search]]
...
27 bytes (3 words) - 06:54, 8 November 2007
#REDIRECT [[Search a list]]
...
27 bytes (4 words) - 13:33, 6 February 2010
#REDIRECT [[Yahoo! search interface]]
...
37 bytes (4 words) - 01:43, 31 January 2011
#REDIRECT [[Yahoo! search interface]]
...
37 bytes (4 words) - 19:47, 4 February 2011
#REDIRECT [[Yahoo! search interface]]
...
37 bytes (4 words) - 08:31, 1 December 2010
#REDIRECT [[A* search algorithm]]
...
33 bytes (4 words) - 22:42, 18 December 2016
#REDIRECT [[Boyer-Moore string search]]
...
39 bytes (4 words) - 20:25, 7 July 2022
#REDIRECT [[Knuth-Morris-Pratt string search]]
...
46 bytes (4 words) - 20:26, 7 July 2022
#REDIRECT [[Search a list of records]]
...
38 bytes (6 words) - 08:38, 22 August 2016
#REDIRECT [[Rosetta Code:Village Pump/Search support]]
...
54 bytes (7 words) - 04:30, 21 July 2009
#REDIRECT [[Active Directory/Search for a user]]
...
48 bytes (7 words) - 14:47, 6 February 2010
<strike><nowiki>{{draft task|Search and Evaluation}}</nowiki></strike> This is a sub-task of the [[Chess player
Create a function or software component which will search the tree of moves from a given chess position up to a maximum depth and det
...
1,013 bytes (149 words) - 23:20, 27 February 2020
Using previously created [[Chess player/Move generation]] and [[Chess player/Search and evaluation]] components, write a ''driver'' or ''main loop'' which will
#Show principal variation during search
...
902 bytes (133 words) - 09:20, 26 June 2023
...a [http://www.google.com/search?q=powerbasic+site%3Arosettacode.org simple search], and I saw what you're referring to. It looks to me like Google didn't st
...ns=http%3A%2F%2Frosettacode.org&num=50&ie=utf-8&oe=utf-8&q=powerbasic&btnG=Search&sitesearch=http%3A%2F%2Frosettacode.org long and complex.] Unfortunately, i
...
2 KB (362 words) - 14:52, 5 October 2009
Node search = Header.Parent;
int Result = Compare.compare(data,((SetNode<T>)search).Data);
...
42 KB (3,026 words) - 16:12, 29 August 2022
// found by Matrix.Search.
// The pseudo error value Stop may be returned to indication the search
...
7 KB (1,190 words) - 04:40, 21 June 2023
...need to do is create the category page. The easiest way is to click on the Search field, type '''Category:Ayrch''', and click Go. It will tell you there is n
As before, click on the Search field on the left, but this time type '''Ayrch''', and click Go. Again, cl
...
7 KB (1,255 words) - 19:41, 25 February 2023
public bool this[T key] { get { return Search(key); } }
SetNode<T> Search = Root;
...
35 KB (3,139 words) - 16:04, 29 August 2022
