This compositional viewpoint immediately provides the simplest and most common multidimensional DFT algorithm, known as the row-column algorithm (after the two-dimensional case, below). That is, one simply performs a sequence of "d" one-dimensional FFTs (by any of the above algorithms): first you transform along the "n"1 dimension, then along the "n"2 dimension, and so on (or actually, any ordering works). This method is easily shown to have the usual O("N" log "N") complexity, where formula_29 is the total number of data points transformed. In particular, there are "N"/"N"1 transforms of size "N"1, etcetera, so the complexity of the sequence of FFTs is: