Rosetta Code

Move-to-front algorithm: Difference between revisions

Page Discussion

Move-to-front algorithm (view source)

Revision as of 22:16, 5 June 2018

38 bytes removed ,  6 years ago
m
→‎{{header|Go}}: small simplifications
(Added Bracmat example)
m (→‎{{header|Go}}: small simplifications)
Line 954:
seq := make([]byte, len(s))
pad := []byte(symbols)
c1for i, c := range []byte(s) {0}
x := byte(bytes.IndexIndexByte(pad, c1)c)▼
for i := 0; i < len(s); i++ {
c := sseq[i] = byte(x)
c1[0] = c
▲ x := byte(bytes.Index(pad, c1))
seq[i] = x
copy(pad[1:], pad[:x])
pad[0] = c
Sonia
1,707

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/247156"