MediaWiki API result
This is the HTML representation of the JSON format. HTML is good for debugging, but is unsuitable for application use.
Specify the format parameter to change the output format. To see the non-HTML representation of the JSON format, set format=json.
See the complete documentation, or the API help for more information.
{
"batchcomplete": "",
"continue": {
"sroffset": 10,
"continue": "-||"
},
"query": {
"searchinfo": {
"totalhits": 11
},
"search": [
{
"ns": 0,
"title": "7.17",
"pageid": 164,
"size": 1498,
"wordcount": 273,
"snippet": "...be included into the cover. Therefore all leaves should be unmarked, which <span class='searchmatch'>mean</span>s that all of their parents should be marked. Now we remove all leaves from \n...f, if we consider its parent, its degree is the number of children + 1. It <span class='searchmatch'>mean</span>s that we have to choose between removing the n children of degree one or th\n",
"timestamp": "2020-09-21T01:04:21Z"
},
{
"ns": 0,
"title": "1.25",
"pageid": 24,
"size": 481,
"wordcount": 78,
"snippet": "...t, or 0.02 miles, deep. If the water were moving at 10 miles an hour, that <span class='searchmatch'>mean</span>s that 10 miles x 0.02 miles x 1 miles flow through the mouth every hour.\n",
"timestamp": "2020-09-01T12:06:20Z"
},
{
"ns": 0,
"title": "4.35",
"pageid": 132,
"size": 668,
"wordcount": 130,
"snippet": "...not clear to me if the first <math>n - \\sqrt n</math> element being sorted <span class='searchmatch'>mean</span>s that the remaining <math>\\sqrt n</math> elements are all bigger or not, bu\n",
"timestamp": "2020-09-20T18:30:31Z"
},
{
"ns": 0,
"title": "1.37",
"pageid": 34,
"size": 814,
"wordcount": 144,
"snippet": "That <span class='searchmatch'>mean</span>s that if all roads were evenly distributed, the U.S. would be covered with \n",
"timestamp": "2020-09-01T12:25:44Z"
},
{
"ns": 0,
"title": "1.33",
"pageid": 32,
"size": 7978,
"wordcount": 1429,
"snippet": "Let's list the constraints implied by these results (where ''>>'' <span class='searchmatch'>mean</span>s faster).\n...k about how you would go about creating a solution if no times were given, <span class='searchmatch'>mean</span>ing you wouldn't know the ordering of the groups. You only know which horse \n",
"timestamp": "2020-09-01T12:23:23Z"
},
{
"ns": 0,
"title": "Chapter 9",
"pageid": 12,
"size": 10029,
"wordcount": 1520,
"snippet": ":[[9.7]]. Implement an algorithm to print all valid (<span class='searchmatch'>mean</span>ing properly opened and closed) sequences of n pairs of parentheses.\n...ided by the number of its edges. Find a cycle in <math>G</math> of minimum <span class='searchmatch'>mean</span> weight.\n",
"timestamp": "2020-10-01T18:10:14Z"
},
{
"ns": 0,
"title": "Chapter 4",
"pageid": 7,
"size": 21397,
"wordcount": 3564,
"snippet": "...e keys precede all the non-negative keys. Your algorithm must be in-place, <span class='searchmatch'>mean</span>ing you cannot allocate another array to temporarily hold the items. How fas\n...manujan number'' can be written two different ways as the sum of two cubes\u2014<span class='searchmatch'>mean</span>ing there exist distinct positive integers <math>a, b, c</math>, and <math>d\n",
"timestamp": "2020-10-01T18:06:49Z"
},
{
"ns": 0,
"title": "Chapter 5",
"pageid": 8,
"size": 6440,
"wordcount": 1065,
"snippet": ":5.4. You are given a unimodal array of <math>n</math> distinct elements, <span class='searchmatch'>mean</span>ing that its entries are in increasing order up until its maximum element, a\n",
"timestamp": "2020-10-01T18:08:24Z"
},
{
"ns": 0,
"title": "Chapter 11",
"pageid": 14,
"size": 13605,
"wordcount": 2218,
"snippet": "...that ''k''-clique has an efficient algorithm for any given <math>k</math>, <span class='searchmatch'>mean</span>ing that <math>k</math> is a constant.\n",
"timestamp": "2020-10-01T18:10:47Z"
},
{
"ns": 0,
"title": "Chapter 3",
"pageid": 6,
"size": 16102,
"wordcount": 2650,
"snippet": "...as that would take <math>O(m)</math> or <math>O(n)</math> operations. This <span class='searchmatch'>mean</span>s the arrays are full of random garbage to begin with, so you must be very c\n",
"timestamp": "2020-10-01T18:06:35Z"
}
]
}
}