將一個n元一維向量向左翻轉i個位置的演算法（一）

def reverseArray[T](n:Int, arr:Array[T])={</p><p>var j = -1<br />val size = arr size<br />var set = Set[Int]()</p><p>def hasMoveAll()={<br />set.size == arr.size<br />}</p><p>while(!hasMoveAll){<br />j += 1<br />println("j = " + j)<br />var t = arr(j%size)<br />var i = j<br />while((i+n) % size != 0){<br />println("set : " + set)<br />println((i%size)+" <- "+(i+n)%size)<br />arr(i%size) = arr((i+n)%size)<br />set += (i+n)%size<br />i += n<br />}<br />set += 0<br />arr(i%size) = t<br />}<br />arr<br />}