Formerly the moor room (now illustrious mourning) underwent name changes 
as it is associated with 
fascist history in 
the dance world that is degrading to my moorish Rose self. 
Any way i am the moorish rose who wrote the html 
to the site and reillustrated 
and rewrote 
the transpositional 
algorithm here. (with errors) The Moors invented the algorithm and 
I am one who is using it well.
Im your lover.
I am your zero.
I am most of all, tired of blood on the dancefloor
History is watching.

#include <cmath> 
using namespace std;
  string Encryption(int no_rows, int len_key, int len_msg,
  string msg, int col_val[]) {
  int x = 0;
  char enc_mat[no_rows + 1][len_key];
  for (int i = 0; i < no_rows + 1; i++) {
    for (int j = 0; j < len_key; j++) {
      if (x >= len_msg) {
        enc_mat[i][j] = '_';
      } else {
        enc_mat[i][j] = msg[x];
      }
      x++;
    }
  }
int t = 1;
string cipher = "";
while (t <= len_key) {
  for (int i = 0; i < len_key; i++) {
    int k = col_val[i];
    if (k == t) {
      for (int j = 0; j < no_rows + 1; j++) {
        cipher += enc_mat[j][i];
      }
      t++;
    }
  }

return cipher;

string decryption (int no_rows, int len_key, string cipher,
  int col_val[]) {
  char dec_mat[no_row + 1][len_key];
  int x = 0. t = 1;
  while (t <= len_key) {
    for (int i = 0; < i < len_key; i++) {
      dec_mat[j][i] = cipher[x];
      x++;
    }
    t++;
   }

  }

string message = "history is watching";
for (int i = 0; i < no_rows + 1 + i++) {
  for (int j = 0; j < len_key; j++) {
    if (dec_mat[i][j]) == '_') {
    dec_mat[i][j] = '_';
  }
  message += dec_mat[i][j];
}
return message;
}