Search results
Page title matches
- Sometimes a function is needed to find the integer square root of '''X''', where '''X''' can be a ::* where '''sqrt''' is the square root function for non─negative real numbers, and ...361 KB (20,294 words) - 12:06, 11 December 2023
- ...y, it is to implement the quadratic residue method of computing the square root. --[[User:Enter your username|Enter your username]] ([[User talk:Enter your ...''exactly'' this operation, but it is not even close to this task's square root method (quadratic residue). ...3 KB (444 words) - 21:20, 15 December 2022
Page text matches
- let root = xDefaultRootWindow dpy let gc = xCreateGC dpy root [GCForeground;GCBackground] gcvalues in ...4 KB (581 words) - 14:42, 29 November 2010
- public static ulong Depth(Node Root) if (Root != null) ...24 KB (2,943 words) - 19:58, 18 January 2023
- static int depth(Node root) if (root != null) ...42 KB (3,026 words) - 16:12, 29 August 2022
- the path from root to leaf*/ Node *root = NULL; //Pointer to root node ...15 KB (1,824 words) - 14:12, 7 November 2020
- <div>[[Averages/Root mean square]]</div> ...3 KB (501 words) - 14:35, 21 August 2016
- ...piled with <code>gcc -Ofast -msse</code> on my machine, looping over <code>root(x, 15)</code> a million times actually became marginally slower after your ...ot (such as raising a number to a fractional power: x ** (1/n) for the nth root of x). ...5 KB (828 words) - 13:55, 1 May 2020
- public static ulong Depth(RedBlackNode Root) if (Root != null) ...56 KB (5,089 words) - 12:19, 16 July 2016
- There are 11 keywords at the root of that tree, and each word can be written as one letter:<br /> ...1,017 members (1 subcategory, 0 files) - 07:00, 14 July 2022
- ::*[[Nth root algorithm]] ::*Shifitng nth root algorithm ...3 KB (388 words) - 02:16, 10 November 2010
- The test sample here is an outline with only one top level root node – we can think of it as representing a single tree. ...ees (or can otherwise be thought of as a single tree with a hidden virtual root). ...4 KB (602 words) - 15:49, 6 September 2021
- How should entries handle the case of a zero root? -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Ge :: If you change the task's requirements that the root be a positive integer, that kills two birds with one stone. -- [[Use ...10 KB (1,647 words) - 00:04, 20 May 2016
- ...ction theorems for zeros|Zeros of a Polynomial]] - [[Nth root#ALGOL 68|Nth root]] & [[Roots of a quadratic function#ALGOL 68|Roots of a quadratic function] * C05: [[wp:Root (mathematics)|Roots]] of One or More [[wp:Transcendental function|Transcend ...6 KB (780 words) - 02:17, 11 June 2010
- The task ''Digital root/Multiplicative digital root'' is a different task with substantially and significant different t ...EXX entry (and other language entries) for ''multiplicative digital root'', and in my opinion, there is enough of a difference in most ...4 KB (720 words) - 06:23, 20 December 2021
- // returns the root node root { _root } ...14 KB (1,440 words) - 10:56, 2 February 2024
- ...at computes an approximation of the principal N<sup>th</sup> root of X as the largest integer less than or equal to R &n R (the root) is a non-negative real number. ...101 KB (6,791 words) - 19:18, 20 April 2024
- ...onouns as an example for a set of words. ‑‑[[User:Root|Root]] ([[User talk:Root|talk]]) 09:43, 23 May 2022 (UTC) ...4 KB (727 words) - 09:44, 23 May 2022
- Later, I might update this to handle [[Nth root|b as a float]]. ...2 KB (231 words) - 04:57, 1 September 2022
- root : tpsList; root,tmpList : tpsList; ...29 KB (3,813 words) - 18:29, 24 June 2024
- ...iously sufficient but introduces the added complexity of invoking a square root. So is it still the "simplest" solution? Is simplicity preferred? Actually ::: It isn't necessary to invoke (use) a SQRT function to find the square root to limit the factors. See the REXX example. [[User:Gerard Schildberger|Ger ...3 KB (519 words) - 09:13, 14 September 2014
- ...ecursive). In C# I used parent references to balance the tree from leaf to root. I then promptly ported the changes back to [[AVL_tree/C%2B%2B|C++]]. The f ...1 KB (234 words) - 03:35, 22 March 2019