Vwwxrf

Is it ethical to recieve stipend after publishing enough papers?

How do I tell my boss that I'm quitting soon, especially given that a colleague just left this week

Mimic lecturing on blackboard, facing audience

What fields between the rationals and the reals allow a good notion of 2D distance?

How does electrical safety system work on ISS?

How much of a Devil Fruit must be consumed to gain the power?

How can ping know if my host is down

How do I fix the group tension caused by my character stealing and possibly killing without provocation?

Is it allowed to activate the ability of multiple planeswalkers in a single turn?

I found an audio circuit and I built it just fine, but I find it a bit too quiet. How do I amplify the output so that it is a bit louder?

How would you translate "more" for use as an interface button?

Why can't the Brexit deadlock in the UK parliament be solved with a plurality vote?

PTIJ: Why is Haman obsessed with Bose?

How to convince somebody that he is fit for something else, but not this job?

How to explain what's wrong with this application of the chain rule?

A variation to the phrase "hanging over my shoulders"

Stack Interview Code methods made from class Node and Smart Pointers

Creating two special characters

Is there any evidence that Cleopatra and Caesarion considered fleeing to India to escape the Romans?

Why the "ls" command is showing the permissions of files in a FAT32 partition?

Change the color of a single dot in `ddot` symbol

Does "he squandered his car on drink" sound natural?

Confused about Cramer-Rao lower bound and CLT

Taxes on Dividends in a Roth IRA

Finding the numerically listed string to the center algorthim

Pattern Matching with MismatchPrint all permutations with repetition of charactersPrint all subsets and permutations of a stringChecking if all the characters from an A-Z is present in the stringFinding the first non-repeating character in a stringFinding longest substring containing k distinct charactersA sequence of mistakesConcatenating two substrings to provide the largest possible palindromic stringFinding longest common prefixGiven a large string, finding the length of the first longest even length sub-string

0

$begingroup$

The algorithm takes input for a string's length for L, and the number of strings altogether for X. The hamming distance is for input D. Input Z calculates the exact amount of all possible characters in the string besides the permutations for input D.

We get a set of Z amount of characters. We divide Z by D which is S. We get B possible permutations of characters that can be generated in a list of X strings. In other words, Z divided by Y groupings of the same X should uniquely have B possible permutations within the Z characters. (For the center numerical listed string based on hamming?)

If the algorithm is, correct (or I've misled). The center of Z is at the S string which should be the B permutation.

NOTE: The concept is to visualize our strings as a number line.

Here the algorithm is written in Ancient Basic from a TRS-80 computer.

0 A=1
1 INPUT "LENGTH OF STRING";L
2 INPUT "X FOR HOW MANY";X
3 INPUT "D FOR HAMMING DISTANCE";D
4 Z = X * X * 1 * L + X * D * D * D
5 S = Z / D
6 B = S / D
7 Y = S / B
8 CL = D * A ≤ X ≤ B * Y
10 P=B*Y
11 PRINT "CLOSEST STRING", CL, "P=", P
12 IF S = S * D / D THEN PRINT"S = S * D / D", S * D / D
13 IF D = Z / S THEN PRINT"D = Z / S", Z / S
15 PRINT"PROOF", P, S

I also continue with the algorithm to find where the 2nd closest string, 3rd closest, 4th and so on.

16 PRINT"WOULD YOU LIKE TO FIND CUSTOM CLOSEST STRING?";R$
17 IF R$=YES$ THEN GOTO 19
18 IF R$=NO$ THEN GOTO 19
19 INPUT "ENTER # FOR CLSE STRING";RT
20 GOTO 21
21 PRINT"YOUR CLOSEST STRING"RT, S / RT
90 NQ = S / RT
91 P = RT * NQ
92 IF P = NC THEN PRINT P, NC, "LUCKY"

strings basic-lang

share

asked 3 mins ago

Travis WellsTravis Wells

11

New contributor

Travis Wells is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

0

$begingroup$

The algorithm takes input for a string's length for L, and the number of strings altogether for X. The hamming distance is for input D. Input Z calculates the exact amount of all possible characters in the string besides the permutations for input D.

We get a set of Z amount of characters. We divide Z by D which is S. We get B possible permutations of characters that can be generated in a list of X strings. In other words, Z divided by Y groupings of the same X should uniquely have B possible permutations within the Z characters. (For the center numerical listed string based on hamming?)

If the algorithm is, correct (or I've misled). The center of Z is at the S string which should be the B permutation.

NOTE: The concept is to visualize our strings as a number line.

Here the algorithm is written in Ancient Basic from a TRS-80 computer.

0 A=1
1 INPUT "LENGTH OF STRING";L
2 INPUT "X FOR HOW MANY";X
3 INPUT "D FOR HAMMING DISTANCE";D
4 Z = X * X * 1 * L + X * D * D * D
5 S = Z / D
6 B = S / D
7 Y = S / B
8 CL = D * A ≤ X ≤ B * Y
10 P=B*Y
11 PRINT "CLOSEST STRING", CL, "P=", P
12 IF S = S * D / D THEN PRINT"S = S * D / D", S * D / D
13 IF D = Z / S THEN PRINT"D = Z / S", Z / S
15 PRINT"PROOF", P, S

I also continue with the algorithm to find where the 2nd closest string, 3rd closest, 4th and so on.

16 PRINT"WOULD YOU LIKE TO FIND CUSTOM CLOSEST STRING?";R$
17 IF R$=YES$ THEN GOTO 19
18 IF R$=NO$ THEN GOTO 19
19 INPUT "ENTER # FOR CLSE STRING";RT
20 GOTO 21
21 PRINT"YOUR CLOSEST STRING"RT, S / RT
90 NQ = S / RT
91 P = RT * NQ
92 IF P = NC THEN PRINT P, NC, "LUCKY"

strings basic-lang

share

asked 3 mins ago

Travis WellsTravis Wells

11

New contributor

Travis Wells is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

$begingroup$

The algorithm takes input for a string's length for L, and the number of strings altogether for X. The hamming distance is for input D. Input Z calculates the exact amount of all possible characters in the string besides the permutations for input D.

We get a set of Z amount of characters. We divide Z by D which is S. We get B possible permutations of characters that can be generated in a list of X strings. In other words, Z divided by Y groupings of the same X should uniquely have B possible permutations within the Z characters. (For the center numerical listed string based on hamming?)

If the algorithm is, correct (or I've misled). The center of Z is at the S string which should be the B permutation.

NOTE: The concept is to visualize our strings as a number line.

Here the algorithm is written in Ancient Basic from a TRS-80 computer.

0 A=1
1 INPUT "LENGTH OF STRING";L
2 INPUT "X FOR HOW MANY";X
3 INPUT "D FOR HAMMING DISTANCE";D
4 Z = X * X * 1 * L + X * D * D * D
5 S = Z / D
6 B = S / D
7 Y = S / B
8 CL = D * A ≤ X ≤ B * Y
10 P=B*Y
11 PRINT "CLOSEST STRING", CL, "P=", P
12 IF S = S * D / D THEN PRINT"S = S * D / D", S * D / D
13 IF D = Z / S THEN PRINT"D = Z / S", Z / S
15 PRINT"PROOF", P, S

I also continue with the algorithm to find where the 2nd closest string, 3rd closest, 4th and so on.

16 PRINT"WOULD YOU LIKE TO FIND CUSTOM CLOSEST STRING?";R$
17 IF R$=YES$ THEN GOTO 19
18 IF R$=NO$ THEN GOTO 19
19 INPUT "ENTER # FOR CLSE STRING";RT
20 GOTO 21
21 PRINT"YOUR CLOSEST STRING"RT, S / RT
90 NQ = S / RT
91 P = RT * NQ
92 IF P = NC THEN PRINT P, NC, "LUCKY"

strings basic-lang

share

asked 3 mins ago

Travis WellsTravis Wells

11

New contributor

Travis Wells is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

0 A=1
1 INPUT "LENGTH OF STRING";L
2 INPUT "X FOR HOW MANY";X
3 INPUT "D FOR HAMMING DISTANCE";D
4 Z = X * X * 1 * L + X * D * D * D
5 S = Z / D
6 B = S / D
7 Y = S / B
8 CL = D * A ≤ X ≤ B * Y
10 P=B*Y
11 PRINT "CLOSEST STRING", CL, "P=", P
12 IF S = S * D / D THEN PRINT"S = S * D / D", S * D / D
13 IF D = Z / S THEN PRINT"D = Z / S", Z / S
15 PRINT"PROOF", P, S

16 PRINT"WOULD YOU LIKE TO FIND CUSTOM CLOSEST STRING?";R$
17 IF R$=YES$ THEN GOTO 19
18 IF R$=NO$ THEN GOTO 19
19 INPUT "ENTER # FOR CLSE STRING";RT
20 GOTO 21
21 PRINT"YOUR CLOSEST STRING"RT, S / RT
90 NQ = S / RT
91 P = RT * NQ
92 IF P = NC THEN PRINT P, NC, "LUCKY"

share

asked 3 mins ago

Travis WellsTravis Wells

11

New contributor

Travis Wells is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share

asked 3 mins ago

Travis WellsTravis Wells

11

New contributor

Travis Wells is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 3 mins ago

Travis WellsTravis Wells

11

New contributor

Travis Wells is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 3 mins ago

Travis WellsTravis Wells

11