How to construct a Vigenère square efficiently?

T

Tannenfels2020-06-21 11:52:12

PHP

Tannenfels, 2020-06-21 11:52:12

There is a task - taking a string of the alphabet as input, build a two-dimensional array based on it, which is the square of Vigenère. I have an example solution, but I'm afraid it will be inefficient in terms of performance. Does anyone have any ideas?

Reply

Answer the question

In order to leave comments, you need to log in

0 answer(s)

Similar questions

S

StayAtHome2015-04-01 12:24:02

How to distinguish a web request from a regular page from a request from the extension itself from a Chrome/Opera extension? 4Reply

M

Max Ba2017-04-06 13:55:11

How to make a key for a TIN? 3Reply

S