Search results for query: *

Comparison of 7 bubble sorts with pictures in 2023 https://qb64phoenix.com/forum/showthread.php?tid=1540&page=2 Won "Russian sorting halves" whose implementation is in C# https://csharpforums.net/threads/russian-sorting-halves-danilin.4221/ 2 times faster according to report of American...

Quantum random observe principles of binomial distribution

It is particularly unclear why programs overload computer starting from development environment and via bat

Window size via single variables: string helped strangely public int w=550, h=330; Added suddenly after Width = w; Height = h; inside its { } And later int n=13, a=w-40, b=h-40; I'll post a new version of Xonix program later in case something else changes My indentations style: Horstmann or...

I program movement of XONIX view through an array of parameters and coordinates and main thing is that it is unclear: how to set colors avoiding names of colors like "Red"? Now dav.DrawEllipse(new Pen(Color.Red, 12),x,y[i],f[i],f[i]); As less than dav.DrawEllipse(new...

Topic from 2019? Answer Mar 28, 2019 with "goto" disabled https://csharpforums.net/threads/russian-sorting-halves-danilin.4221/#post-10188 and I created new version with While Computer guessing number from 0 to billion to 10^9 by logarithmic time by 30 steps using System; using System.Text...

line 12: if (p % j == 0 && f!=2) now: 2 is prime

Conversion to a integer: against design of form "5.0" Initially there were 3 states of flag f: ternary 0 = start & 1 = multiplier & 2 = prime so flag is an ordinary integer Now logic is: while flag f<1 reaches root we check whether root has been reached & then flag f=2 & exit q flag is...

Prime numbers are accelerated: root is removed from cycle and it is possible to count a prime number by counting such and such and it is found out: in range of up to 1 million numbers: 78 thousand primes using System; using System.Text; // PRIME_mult.cs DANILIN namespace prime //...

my program from topic: 7 elements online rextester.com/YRFA61366 by excluding of condition //if (amount[list]<= Inside) // current mass < Knapsack we start and see column of solutions to avoid adding variables: I highlight and copy results & I paste it into notepad and Ctrl+G & I see 128...

"you are trying to cut down the number of comparisons by hiding them into your vector multiplication of the array" absolutely everything is compared and only what is less than or equal to Knapsack is printed if (amount[list]<= Inside) // current mass < Knapsack { Console.WriteLine("{0}...

I have it converted from binary to a number 0 or 1 in current calculation only 1 character jack[k]=Convert.ToInt32(bin[list].Substring(k,1)); corresponding to number of list item what is real to use even on paper by manually

Now my design visually right observer of margins About quantity: for n=2 1 is added to left and investigated 111 110 101 100 Right part is taken from them 11 10 01 00 with all zeros Where number of registers is equal to number of items If you examine everything up to 0 then we'll get to...

origin: "adding an extra register and 0 remain on left in cipher" otherwise number of characters in cipher will decrease plus meaningful variable names using System; // Knapsack C# binary DANILIN using System.Text; // rextester.com/SEUD75646 namespace Knapsack { class Knapsack {...

I indented my code in indent style and commented variable names using System; // Knapsack C# binary DANILIN using System.Text; // rextester.com/MUTNY8650 namespace Knapsack { class Knapsack { static void Main() { int n=7; // number of elements int G=5...

Knapsack 0-1 C# binary & rosettacode & WE Classic Knapsack problem is solved in many ways Contents: Knapsack problem - Rosetta Code Long read: rosettacode.org/wiki/Knapsack_problem/0-1 My newest program synthesizes all ciphers from 0 & 1 adding an extra register and 0 remain on left in...

Big C & P: winning Small c & p: losing Original Excel formula: =log(1-0,99)/log(1-0,25) =16 So after 16 zeros in a row for probability 0.25=25%=1/4 further reliability of 99% of one So letters are big or small: =log(1-C)/log(1-P) =log(c)/log(p) =log(0,01)/log(0,75) =16 C+(1-P)^N=1 C+p^N=1...

Checking in Wolframalpha Reliability win and lose both probability of winning and losing create 4 combinations: C+p^N=1 (1-C)+p^N=1 C+(1-p)^N=1 (1-C)+(1-p)^N=1 Everything is interchangeable: C=1-c c=1-C P=1-p p=1-P Artificial intelligence of Wolframalpha knows logarithm: solve C+(1-p)^N=1...

I'm testing idea: RNG trigonometric created a bad array that doesn't pass validation binary even\odd and small\large therefore, we shuffle equally real in Excel & basic & c# just using this bad array means: sequence is weak shuffled through a sequence of weak turns into a normal...

I will study our programs on weak arrays but: more carefully: a = 15973 d = 37951 yes inverse sorted d and dependent a d = 13579 a = 31759 I'm testing the idea: RNG trigonometric created a bad array that doesn't pass validation binary even\odd and small\large therefore, we shuffle...