Search results

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...lgorithms to accomplish the same goal, it may be worth adding as a second, alternate version. If it is essentially the same process, just clearer, my inclinatio Since you are a new user, my gut reaction would be to say: add as an alternate version and watch the reaction from the community. ...
    5 KB (863 words) - 16:58, 4 November 2018
  • ===Alternate Version=== private static boolean sumOfDistinctSquares(int aN, List<Integer> aSquares) { ...
    47 KB (6,143 words) - 16:52, 7 January 2024
  • ...b-classification. (I know that SML may have a huge impact on this once an approach is found). * [[Active Directory/Connect]] - requires an LDAP method ...
    31 KB (3,892 words) - 04:28, 28 December 2011
  • * alternate method: * another alternate method: ...
    115 KB (15,307 words) - 11:23, 29 February 2024
  • ...ing the instrumented code. An aspect could be used to capture the calls to an entire API and log the arguments and return values. ...ot accessible by the class itself, only by the instrumenting Aspect code. An object-oriented Aspect resembles a class, except that its instance variable ...
    27 KB (4,106 words) - 09:27, 7 November 2023
  • Alternate version using LOOP. Coefficients are passed in a vector. WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, ...
    69 KB (9,064 words) - 18:30, 17 March 2024
  • The Chief of the Police doesn't like odd numbers and wants to have an even number for his department. 1 PP:DO P = 2,7,2 !The police demand an even number. They're special and use violence. ...
    129 KB (13,660 words) - 10:15, 30 March 2024
  • A semicolon (;) is ''not'' the same as a concatenate operator (+), it is an instruction that works only on the <code>PRINT</code> statement to suppress Alternate method using the <code>CONCATENATE</code> intrinsic function: ...
    68 KB (8,537 words) - 16:37, 3 May 2024
  • (let* ((a (an-integer-between 1 (floor sum 3))) (b (an-integer-between (1+ a) (floor (- sum a) 2))) ...
    44 KB (5,573 words) - 14:57, 9 February 2024
  • * [http://unicon.org/utr/utr6b.pdf An IVIB Primer (Visual Interface Builder, UTR6b)] ...object oriented pre-processor), MT Icon (a Multi-Threaded variant), Jcon (an implementation in Java), and others. And while the graphics interface was ...
    50 KB (7,414 words) - 19:58, 7 March 2016
  • ...ues. Types of iterative loops include [[for loop]]s and [[foreach]] loops. An iterative loop is a repetition but with a variable dependent on the current '''Examples here should be migrated to an appropriate [[:Category:Iteration|Iteration]] page and removed from here. I ...
    35 KB (5,040 words) - 13:31, 3 October 2023
  • Delphi doesn't support any alternate number separators for compiler source code input. However, Delphi does supp ! a comma at the beginning or end will parse as a word, likely causing an error ...
    28 KB (3,428 words) - 18:37, 7 January 2024
  • ...e'' to be any output string obtained by deleting zero or more symbols from an input string. ...'B'' &equiv; ''B''[0]&hellip; ''B''[n - 1], m &lt; n be strings drawn from an alphabet &Sigma; of size s, containing every distinct symbol in A + B. ...
    120 KB (16,073 words) - 15:17, 28 April 2024
  • Here is an alternative version: ===An alternate ("Goto-less") approach=== ...
    80 KB (10,015 words) - 16:28, 3 May 2024
  • Here's one approach which might be sufficiently close to the task requirements: === Alternate approach === ...
    126 KB (14,070 words) - 17:57, 26 May 2024
  • Some strings have no tokens, so an empty string &nbsp; (or one just containing spaces) &nbsp; would be the res Alternative based on the approach described in [https://saltysylvi.github.io/blog/flat1.html this blog post]: ...
    118 KB (15,310 words) - 20:44, 24 February 2024
  • An integer is said to be "self-describing" if it has the property that, when d # As an optional stretch goal - generate and display the set of self-describing num ...
    123 KB (15,101 words) - 11:02, 4 February 2024
  • The second (tail) recursion above can be turned into an iteration, as follows: Fully eventual counting solution. This would be appropriate for controlling an actual robot, where the climb operation is non-instantaneous (and therefore ...
    41 KB (5,513 words) - 14:41, 28 March 2024
  • ...ction which takes two string parameters: 'stones' and 'jewels' and returns an integer. -- derived from an equivalent function with 2 distinct arguments ...
    69 KB (8,712 words) - 16:53, 14 March 2024
  • This is a straightforward approach that counts the number of swaps for each permutation. To generate all permu An algorithm that doesn't go through all permutations, per Knuth tAoCP 7.2.1.2 ...
    70 KB (8,834 words) - 15:00, 14 February 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)