AMD! Convenient, because I'm running a 5900HS right now. :D Wait ... you want to be able to pick the permutation? I thought it's about a fixed transposition, b

AMD! Convenient, because I'm running a 5900HS right now. :D Wait ... you want to be able to pick the permutation? I thought it's about a fixed transposition, but you want to choose? lol What a complicated mess! 234 ... two blocks of data, containing three lines of data, containing four entries of data. I'm not sure the example is sufficient for me to understand. I hope I can figure this out for other cases than 1 at the start, which seems to be a bad example for understanding this. if 1 was 2, do I instead, then, pick every second number? I'm trying to wrap my head around this, starting with wikipedia. Why don't you use a better data structure? Seems rather wasteful, CPU-wise, not coming up with some more generic structure that makes it easier to permute? But ... I guess that's not allowed, otherwise you'd not need in-place replacement. On the other hand, as long as I store everything in-place it shouldn't matter, as long as the result is correct. But are you sure you need in-place replacement as long as you can get the correct, permutated result? Do you request the same results more than once? Yes, I keep asking again looking for a way to avoid it. I have to make sure I cover everything and know the desired outcome exactly. Like, if you just care about the result itself, then that's different to having to store it in memory. Hm. Given that there's some sort of memory limitation ... How much space do I have, in bytes/kbytes, for code? Can I allocate my own memory? Questions, questions, questions. Details, details, details.