This paper addresses routing algorithm for a classic network called rearrangeable network with a complexity which is minimum than any other reported algorithms in this class. A new routing algorithm is presented for symmetric ...