设a[0:n-1]是有n个元素的数组，k(0≤k≤n-1)是一个非负整数。试设计一个算法将子数组a[0:k-1]与a[k:n-1]换位。要求算法在最坏的情况下耗时0（n),且只用到0（1）的辅助空间。-Let A [0: n-1] is an array of n elements, k (0 ≤ k ≤ n-1) is a non-negative integer. The trial design of an algorithm of the sub-array A [0: k-1] and

矩阵的运算，包括加减乘法运算，还有转置，文件很小-Matrix operations, including addition and subtraction multiplication, and transposition, the file is very small

矩阵的运算，包括加减乘法运算，还有转置，文件很小-Matrix operations, including addition and subtraction multiplication, and transposition, the file is very small

In this work, we study vector control and sliding mode control of series-connected five-phase two asynchronous machines supplied with a three levels inverter.After presentation of multiphase machines, we worked out the mathematical model of five phas

实现：矩阵的创建，输出，复制，转置，加法，减法，乘以一个数，通过行列坐标设置和获取矩阵该位置元素的值(Implementation: matrix creation, output, copy, transposition, addition, subtraction, multiplied by a number, set up and get the value of the location element through the row and column coordinates.)