Данный отчёт сгенерирован 10.02.2023 18:21:31 UTC.
HTML версия (этот сайт) сгенерирован 10.02.2023 18:21:38 UTC.
Коммит: [bfeb65b9] add automatic zip creation 10.02.2023 18:21:31
HTML версия (этот сайт) сгенерирован 10.02.2023 18:21:38 UTC.
Коммит: [bfeb65b9] add automatic zip creation 10.02.2023 18:21:31
Задача: Обертання масиву
10.02.2023 18:21:31
Описание: Визначте функцію myReverse, яка отримує довільний масив
та перебудовує його елементи у зворотному порядку.
Функція нічого не повертає, лише змінює свій аргумент.
Не використовуйте метод reverse.
10.02.2023 18:21:31
Решений: 99
10.02.2023 18:21:31
Обертання масиву
10.02.2023 18:21:31
function myReverse(m)
{
for (let i = m.length-1; i >= 0; i--)
{
m.push(m[i]);
}
m.splice(0, m.length/2);
}
function myReverse(array){
for (let i = 0; i < array.length/2; i++) {
let temp = array[i];
array[i] = array[array.length - i - 1];
array[array.length - i - 1] = temp;
}
}
function myReverse(arr) {
for (let i = 0, j = arr.length - 1; i < j; i++, j--) {
let a = arr[i];
arr[i] = arr[j];
arr[j] = a;
}
}
function myReverse(m){
for(i=0,j=m.length-1;j-i>=1;i++,j--){
let r=m[i]
m[i]=m[j]
m[j]=r
}
}
function myReverse(m) {
let t
for(let i = 0, j = m.length -1; i < j; i++, j --){
t = m[j]
m[j] = m[i]
m[i] = t
}
}
function myReverse(a) {
for (let i = 0, j = a.length - 1; i < j; i += 1, j -= 1) {
let t = a[i]; a[i] = a[j]; a[j] = t;
}
}
function myReverse(arr) {
let arr2 = [];
for (let i = arr.length-1; i >= 0; i--) {
arr2.push(arr[i])
}
for (let i = 0; i < arr2.length;i++) {
arr[i] = arr2[i]
}
}
function myReverse(m) {
let dl = m.length;
let a = 0;
for (let i = (dl - 1); i >= 0; i--) {
m[dl + a] = m[i]
a++;
}
m = m.splice(0, dl)
return m;
}
function myReverse(arr){
let element = Math.floor(arr.length / 1.3);
while (element > 0) {
for(let i = 0; i + element < arr.length; i++) {
if (arr[i] < arr[i + element]) {
let temporary = arr[i + element];
arr[i + element] = arr[i];
arr[i] = temporary;
}
}
element = Math.floor(element / 1.3);
}
}
function myReverse(arr) {
let N = arr.length;
for (let i = 0; i< N/2; i++)
[arr[i], arr[N-1-i]] = [arr[N-1-i],arr[i]];
}
function myReverse(arr) {
let rev = 0;
for(let i = 0, j = arr.length - 1; i < j; i++, j--) {
rev = arr[j];
arr[j] = arr[i];
arr[i] = rev;
}
}
function myReverse(arr)
{
let temp = [...arr];
for(let i = 0; i < arr.length; i++)
arr[i] = temp[temp.length - i - 1];
}
function myReverse (m){
let a= m.reverse();
}
function myReverse (array) {
for (let i = 0; i < array.length - 1; i++) {
array.splice(i, 0, array.pop());
}
return array;
}
function myReverse(arr){
let k= 0;
for (let i = 0; i < parseInt(arr.length/2); i++) {
k = arr[i];
arr[i] = arr[arr.length-1 -i];
arr[arr.length-1 -i] = k;
}
}
function myReverse(m) {
let count = m.length;
let a = 0;
for(let i = count - 1; i >= 0; i--){
m[count + a] = m[i];
a++;
}
m = m.splice(0, count)
return m;
}
function myReverse(arr) {
for(let i = 0; i <= Math.floor(arr.length/2); i++) {
let t = arr[arr.length-1-i];
arr[arr.length-1-i] = arr[i];
arr[i] = t;
}
}
function myReverse ( m ) {
m.reverse ( );
}
function myReverse(a) {
let i = 0;
let t = 0;
while (i < a.length / 2) {
let j = a.length - i - 1;
t = a[i];
a[i] = a[j];
a[j] = t;
i++;
}
}
function myReverse(arr){
for(let i = 0; i< arr.length;i++){
arr.splice(i,0,arr.pop())
}
}
function myReverse(m) {
const a = m.length;
for (let i = 0; i < a; i++)
{
m.splice(m.length - i, 0, m[i]);
}
m.splice(0, a);
return m;
}
function myReverse(arr){
for(let i=0;i< arr.length/2;i++){
var k = arr[i];
arr[i] = arr[arr.length-1-i];
arr[arr.length-1-i] = k;
}
return arr
}
function myReverse(arr){
arr.reverse();
}
function myReverse(a)
{
let b = 0;
let g = 1;
for(let i = 0; i < (a.length / 2);i++)
{
b = a[i];
a[i] = a[a.length - g]
a[a.length - g] = b;
g++;
}
return a
}
let arr = [1,2,3,4,5]
function myReverse(arr) {
let p = (arr.length)-1
for (let i = arr.length - 1; i >= 0; i--) {
arr.push(arr[i])
}
let h = 0
while((arr.length)-1 !== p){
arr.shift(h)
h++
}
return arr
}
myReverse(arr)
console.log(arr)
function myReverse(arr1){
let temp;
for(let i=0,j=arr1.length-1; i< j; i++,j--)
{
temp = arr1[j];
arr1[j] = arr1[i];
arr1[i] = temp;
}
}
function myReverse(m) {
for(let i = 1; i < m.length; i++ ){
m.unshift(m[i]);
m.splice(i+1, 1);
}
}
function myReverse (m){
m.reverse()
}
function myReverse(arr)
{
for (let i = 0; i <= arr.length/2; i++)
{
let k = arr[i]
arr[i] = arr[arr.length-1-i]
arr[arr.length-1-i] = k
}
}
function myReverse(array){
for (let i = 0 , x = array.length - 1 ; i < x ; i ++ , x -= i ){
let m = array[i];
array[i] = array[x];
array[x] = m;
}
return array
}
function myReverse(arr)
{
for(let i = 0;i< arr.length/2;i++)
{
let t = arr[i];
arr[i] = arr[arr.length-(i+1)];
arr[arr.length-(i+1)] = t;
}
}
function myReverse(a)
{
for (let i = 0; i < a.length/2; i++)
{
let b = a[i]
let c = a.length - i - 1
a[i] = a[c]
a[c] = b
}
}
function myReverse(m) {
let t;
for(let i = 0; i <= m.length/2; i ++){
t = m[i];
m[i] = m[m.length - 1 - i];
m[m.length - 1 - i] = t;
}
}
function myReverse(arr){
for(let i=0;i< arr.length/2;i++){
let k = arr[i];
arr[i] = arr[arr.length-1-i];
arr[arr.length-1-i] = k;
}
return arr;
}
function myReverse(arr){
for(let i = 0; i< arr.length;i++){
arr.splice(i,0,arr.pop())
}
}
function myReverse(a) {
for(let i = 0; 2*i <= a.length; ++i) {
let j = a.length - i - 1;
let c = a[j];
a[j] = a[i];
a[i] = c;
}
}
function myReverse(arr)
{
for(let i = arr.length - 1, j = 0; i > j && j <= (arr.length - 1) / 2; i --, j ++)
{
let a = arr[i];
arr[i] = arr[j];
arr[j] = a;
}
}
function myReverse(m){
let i = 0
let n = 0
while (i < (m.length / 2)){
n = m[(0 + i)]
m[(0 + i)] = m[((m.length - 1) - i)]
m[((m.length - 1) - i)] = n
i++
}
return m
}
function myReverse(x){
let t;
for(let i = 0; i < x.length / 2 ; i++){
t = x[i];
x[i] = x[x.length-1-i];
x[x.length-1-i] = t;
}
}
function myReverse(arr){
let buf;
for (let i = 0; i < arr.length/2; i++) {
buf = arr[i];
arr[i] = arr[arr.length - 1 - i];
arr[arr.length - 1 - i] = buf;
}
}
function myReverse(a){
for (let i = 0, k = a.length-1; k-i>=1; i++, k--){
let v = a[i]
a[i] = a[k]
a[k] = v
}
}
function myReverse(arr){
for(let i=0;i< arr.length/2;i++){
var k = arr[i];
arr[i] = arr[arr.length-1-i];
arr[arr.length-1-i] = k;
}
return arr
}
function myReverse(m) {
let n = m.length-1;
for(let i=0; i<=n/2; i++) {
let temp = m[i];
m[i] = m[n-i];
m[n-i] = temp;
}
}
let a = [1, 2, 3];
myReverse(a);
console.log(a)
function myReverse(array){
for (let i = 0; i < array.length; i++) {
array.splice(i, 0, array.splice(array.length - 1)[0]);
}
}
function myReverse(m) {
m.reverse();
}
function myReverse(arr)
{
let temp = [...arr];
for(let i = 0; i < arr.length; i++)
arr[i] = temp[temp.length - i - 1];
}
function myReverse(arr){
let element = Math.floor(arr.length / 1.3);
while (element > 0) {
for(let i = 0; i + element < arr.length; i++) {
if (arr[i] < arr[i + element]) {
let temporary = arr[i + element];
arr[i + element] = arr[i];
arr[i] = temporary;
}
}
element = Math.floor(element / 1.3);
}
}
function myReverse(arr){
let el;
for (let i = 0, g = arr.length - 1; i < g; i++, g--){
el = arr[g];
arr[g] = arr[i];
arr[i] = el;
}
}
function myReverse ( m ) {
m.reverse ( );
}
function myReverse(a) {
let arrItem = a.length;
let b = 0;
for (let i = (arrItem - 1); i >= 0; i--) {
a[arrItem + b] = a[i]
b++
}
a = a.splice(0, arrItem);
}
function myReverse(arr) {
for (let i = 0; i < arr.length / 2; i++) {
let temp = arr[i];
arr[i] = arr[arr.length - 1 - i];
arr[arr.length - 1 - i] = temp;
}
}
function myReverse(m)
{
for (let n = 0; n <= m.length; n = n + 1)
{
m.splice( n, 0, m.pop())
}
return m;
}
function myReverse(arr){
let temporaryElement;
for(let i=0,j=arr.length-1; i< j; i++,j--){
temporaryElement = arr[j];
arr[j] = arr[i];
arr[i] = temporaryElement;
}
}
function myReverse(arr) {
for (let i = 0, j = arr.length - 1; i< arr.length/2; i++, j-- ) {
let save = arr[i];
arr[i]=arr[j];
arr[j]=save;
}
}
function myReverse(m) {
for (let i = 0; i < m.length/2; i++) {
glass = m[i]
m[i]=m[m.length-1-i]
m[m.length-i-1]=glass
}
}
function myReverse(arr){
let box;
for(let i = 0; i < arr.length/2; i++){
box = arr[i];
arr[i] = arr[arr.length - 1 - i];
arr[arr.length - 1 - i] = box;
}
}
function myReverse(arr){
arr.reverse();
}
function myReverse(a){
a.reverse();
}
function myReverse(arr) {
for (let i = 0; i < arr.length / 2; i++) {
let temp = arr[i];
let backIndex = arr.length - i - 1;
arr[i] = arr[backIndex];
arr[backIndex] = temp;
}
return arr;
}
function myReverse(m){
let index;
for(let i=0,j=m.length-1; i< j; i++,j--){
index = m[j];
m[j] = m[i];
m[i] = index;
}
return m;
}
function myReverse(m){
let k = m.length-1;
for (; k >= 0; k--){
m.push(m[k]);
}
for (let i = m.length/2; i > 0; i--){
m.shift();
}
return m;
}
function myReverse(arr){
for(let i = 0;i !== arr.length - i - 1;i++){
[arr[i],arr[arr.length - i - 1]] = [arr[arr.length - i - 1],arr[i]]
}
}
function myReverse(arr){
for(let i = 0; i< arr.length/2; i++){
var k = arr[i];
arr[i] = arr[arr.length-1-i];
arr[arr.length-1-i] = k;
}
return arr
}
function myReverse(array){
arr = []
for(let i = 0;i< array.length;i++){
arr[i] = array[(array.length - 1) - i]
}
for(let i = 0;i< arr.length;i++){array[i]=arr[i]}
return arr
}
function myReverse(m)
{
for(let i=0;i< m.length;i++)
{
m.splice(i,0,m.pop())
}
}
function myReverse(arr) {
for(let i = 0; i < arr.length; i++) {
arr.splice(i,0,arr.pop())
}
}
function myReverse(a)
{
for (let i = 0, j = a.length - 1; i < a.length / 2; i++, j--)
{
let tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
}
function myReverse(arr) {
for (let i = 0; i < arr.length / 2; i++) {
let temp = arr[i];
let backIndex = arr.length - i - 1;
arr[i] = arr[backIndex];
arr[backIndex] = temp;
}
return arr;
}
function myReverse(arr) {
let m = arr.length - 1;
for(let i = 0; i <= m/2; i++) {
let k = arr[i];
arr[i] = arr[m - i];
arr[m - i] = k;
}
}
function myReverse(m) {
let n = m.length;
for(let i = 0; i < n; i++){
m.push(m[n - (1 + i)]);
}
m.splice(0, n);
}
function myReverse(a){
for(let i = 0, j = a.length - 1; i < j; i++, j--){
let n = a[i];
let m = a[j];
a.splice(i, 1, m);
a.splice(j, 1, n);
}
return a;
}
function myReverse (m)
{
m.reverse();
}
function myReverse(arr) {
for (let i = 0; i < arr.length / 2; i++) {
let temp = arr[i];
let backIndex = arr.length - i - 1;
arr[i] = arr[backIndex];
arr[backIndex] = temp;
}
return arr;
}
function myReverse(arr) {
for (let i = 0; i < arr.length / 2; i++) {
let temp = arr[i];
let backIndex = arr.length - i - 1;
arr[i] = arr[backIndex];
arr[backIndex] = temp;
}
return arr;
}
function myReverse(m)
{
return m.reverse();
}
function myReverse(arr) {
for (let i = 0; i < arr.length / 2; i++) {
let temp = arr[i];
let backIndex = arr.length - i - 1;
arr[i] = arr[backIndex];
arr[backIndex] = temp;
}
return arr;
}
function myReverse(arr) {
let N = arr.length;
for(let i = 0; i< N/2; i++)
[arr[i], arr[N-1-i]]=[arr[N-1-i],arr[i] ];
}
function myReverse(m) {
for(let i = 0; i< m.length / 2; i++){
console.log(`${i} : ${m.length - i - 1}`);
[m[i], m[m.length - i - 1]] = [ m[m.length - i - 1], m[i]];
}
}
function myReverse(arr) {
const shadow = Array.from(arr)
for (let i = 0; i < shadow.length; i++) {
arr[i] = shadow[shadow.length - i - 1]
}
}
function myReverse(a){
for(let i = 0,j = a.length - 1;i< j;i++,j--){
let n = a[i];
let m = a[j];
a.splice(i, 1, m);
a.splice(j, 1, n);
}
return a;
}
/*
Визначте функцію myReverse, яка отримує довільний масив
та перебудовує його елементи у зворотному порядку.
Функція нічого не повертає, лише змінює свій аргумент.
Не використовуйте метод reverse.
*/
//BEGIN
function myReverse(m) {
for (let i = 0, j = m.length - 1; i < j; i += 1, j -= 1) {
let t = m[i]; m[i] = m[j]; m[j] = t;
}
if (m==0){
m = 0
}
}
function myReverse(m) {
for(let i=0; i m.reverse();}
return m;
}
function myReverse(arr) {
let temp = 0;
for(let i = 0, j = arr.length-1; i < j; i++,j--) {
temp = arr[j];
arr[j] = arr[i];
arr[i] = temp;
}
}
function myReverse(array) {
array.reverse()
}
function myReverse(arr)
{
let i = 0;
let j = arr.length - 1;
while(i < arr.length / 2 + 1 && j > arr.length / 2 - 1)
{
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
i++;
j--;
}
return arr;
}
function myReverse(m){
for(let i = 0; i < m.length / 2; i++){
let t;
t = m[i];
m[i] = m[m.length - i - 1];
m[m.length - i - 1] = t;
}
}
function myReverse(arr){
for(let i = arr.length - 1; i >= 0; i--){
arr.push(arr[i]);
}
arr.splice(0, arr.length/2);
}
function myReverse(n) {
for (let i = 0; i <= n.length / 2; i++) {
c = n[i]
n[i] = n[n.length - i - 1]
n[n.length - i - 1] = c
}
return n
}
function myReverse(n) {
for (let i = 0; i <= n.length / 2; i++) {
c = n[i]
n[i] = n[n.length - i - 1]
n[n.length - i - 1] = c
}
return n
}
function myReverse(m){
for (let i = 0; i < (m.length/2); i++){
let c = m[i];
m[i]=m[m.length - 1 - i];
m[m.length - 1 - i] = c;
}
}
function myReverse(m) {
let size = m.length;
let half = size >> 1;
for(let i = 0; i < half; i++){
let tmp = m[i];
m[i] = m[size - i - 1];
m[size - i - 1] = tmp;
}
}
function myReverse (arr){
for (let i=0, n; i< arr.length/2; i++){
n=arr[i];
arr[i]=arr[arr.length-1-i];
arr[arr.length-1-i]=n;
}
return;
}
function myReverse(arr) {
for(let i = 0; i < Math.floor(arr.length / 2); i++) {
let temp = arr[i];
arr[i] = arr[arr.length - 1 - i];
arr[arr.length - 1 - i] = temp;
}
}
function myReverse(m) {
for(let i=m.length-1; i >= 0; i--){
m.push(m[i]);
}
m.splice(0, m.length/2);
return m;
}
function myReverse(m)
{
for(let i=0;i< m.length;i++)
{
m.splice(i,0,m.pop())
}
}
function myReverse(m) {
for (let i = 0, j = m.length - 1; i < j; i++, j--) {
[m[i], m[j]] = [m[j], m[i]];
}
return m;
}
function myReverse(a){
let arr = [];
for(let i = 0,j=a.length-1;i< a.length;i++,j--){
arr[i]=a[j];
}
for(let i = 0;i< arr.length;i++){a[i]=arr[i]}
}
function myReverse(m) {
let t = m.slice();
for(k = 1; k <= m.length; k++){
let x = t[t.length-k];
m.splice([k]-1,1,x);
}
return m;
}
function myReverse(a)
{
for(let i = 0; i < a.length/2; i++)
{
let t = a[i]
a.splice(i,1,a[a.length - 1 - i])
a.splice(a.length - 1 - i,1,t)
}
return(a)
}
{
for (let i = m.length-1; i >= 0; i--)
{
m.push(m[i]);
}
m.splice(0, m.length/2);
}
for (let i = 0; i < array.length/2; i++) {
let temp = array[i];
array[i] = array[array.length - i - 1];
array[array.length - i - 1] = temp;
}
}
for (let i = 0, j = arr.length - 1; i < j; i++, j--) {
let a = arr[i];
arr[i] = arr[j];
arr[j] = a;
}
}
for(i=0,j=m.length-1;j-i>=1;i++,j--){
let r=m[i]
m[i]=m[j]
m[j]=r
}
}
let t
for(let i = 0, j = m.length -1; i < j; i++, j --){
t = m[j]
m[j] = m[i]
m[i] = t
}
}
for (let i = 0, j = a.length - 1; i < j; i += 1, j -= 1) {
let t = a[i]; a[i] = a[j]; a[j] = t;
}
}
let arr2 = [];
for (let i = arr.length-1; i >= 0; i--) {
arr2.push(arr[i])
}
for (let i = 0; i < arr2.length;i++) {
arr[i] = arr2[i]
}
}
let dl = m.length;
let a = 0;
for (let i = (dl - 1); i >= 0; i--) {
m[dl + a] = m[i]
a++;
}
m = m.splice(0, dl)
return m;
}
let element = Math.floor(arr.length / 1.3);
while (element > 0) {
for(let i = 0; i + element < arr.length; i++) {
if (arr[i] < arr[i + element]) {
let temporary = arr[i + element];
arr[i + element] = arr[i];
arr[i] = temporary;
}
}
element = Math.floor(element / 1.3);
}
}
let N = arr.length;
for (let i = 0; i< N/2; i++)
[arr[i], arr[N-1-i]] = [arr[N-1-i],arr[i]];
}
let rev = 0;
for(let i = 0, j = arr.length - 1; i < j; i++, j--) {
rev = arr[j];
arr[j] = arr[i];
arr[i] = rev;
}
}
{
let temp = [...arr];
for(let i = 0; i < arr.length; i++)
arr[i] = temp[temp.length - i - 1];
}
let a= m.reverse();
}
for (let i = 0; i < array.length - 1; i++) {
array.splice(i, 0, array.pop());
}
return array;
}
let k= 0;
for (let i = 0; i < parseInt(arr.length/2); i++) {
k = arr[i];
arr[i] = arr[arr.length-1 -i];
arr[arr.length-1 -i] = k;
}
}
let count = m.length;
let a = 0;
for(let i = count - 1; i >= 0; i--){
m[count + a] = m[i];
a++;
}
m = m.splice(0, count)
return m;
}
for(let i = 0; i <= Math.floor(arr.length/2); i++) {
let t = arr[arr.length-1-i];
arr[arr.length-1-i] = arr[i];
arr[i] = t;
}
}
m.reverse ( );
}
let i = 0;
let t = 0;
while (i < a.length / 2) {
let j = a.length - i - 1;
t = a[i];
a[i] = a[j];
a[j] = t;
i++;
}
}
for(let i = 0; i< arr.length;i++){
arr.splice(i,0,arr.pop())
}
}
const a = m.length;
for (let i = 0; i < a; i++)
{
m.splice(m.length - i, 0, m[i]);
}
m.splice(0, a);
return m;
}
for(let i=0;i< arr.length/2;i++){
var k = arr[i];
arr[i] = arr[arr.length-1-i];
arr[arr.length-1-i] = k;
}
return arr
}
arr.reverse();
}
{
let b = 0;
let g = 1;
for(let i = 0; i < (a.length / 2);i++)
{
b = a[i];
a[i] = a[a.length - g]
a[a.length - g] = b;
g++;
}
return a
}
function myReverse(arr) {
let p = (arr.length)-1
for (let i = arr.length - 1; i >= 0; i--) {
arr.push(arr[i])
}
let h = 0
while((arr.length)-1 !== p){
arr.shift(h)
h++
}
return arr
}
myReverse(arr)
console.log(arr)
let temp;
for(let i=0,j=arr1.length-1; i< j; i++,j--)
{
temp = arr1[j];
arr1[j] = arr1[i];
arr1[i] = temp;
}
}
for(let i = 1; i < m.length; i++ ){
m.unshift(m[i]);
m.splice(i+1, 1);
}
}
m.reverse()
}
{
for (let i = 0; i <= arr.length/2; i++)
{
let k = arr[i]
arr[i] = arr[arr.length-1-i]
arr[arr.length-1-i] = k
}
}
for (let i = 0 , x = array.length - 1 ; i < x ; i ++ , x -= i ){
let m = array[i];
array[i] = array[x];
array[x] = m;
}
return array
}
{
for(let i = 0;i< arr.length/2;i++)
{
let t = arr[i];
arr[i] = arr[arr.length-(i+1)];
arr[arr.length-(i+1)] = t;
}
}
{
for (let i = 0; i < a.length/2; i++)
{
let b = a[i]
let c = a.length - i - 1
a[i] = a[c]
a[c] = b
}
}
let t;
for(let i = 0; i <= m.length/2; i ++){
t = m[i];
m[i] = m[m.length - 1 - i];
m[m.length - 1 - i] = t;
}
}
for(let i=0;i< arr.length/2;i++){
let k = arr[i];
arr[i] = arr[arr.length-1-i];
arr[arr.length-1-i] = k;
}
return arr;
}
for(let i = 0; i< arr.length;i++){
arr.splice(i,0,arr.pop())
}
}
for(let i = 0; 2*i <= a.length; ++i) {
let j = a.length - i - 1;
let c = a[j];
a[j] = a[i];
a[i] = c;
}
}
{
for(let i = arr.length - 1, j = 0; i > j && j <= (arr.length - 1) / 2; i --, j ++)
{
let a = arr[i];
arr[i] = arr[j];
arr[j] = a;
}
}
let i = 0
let n = 0
while (i < (m.length / 2)){
n = m[(0 + i)]
m[(0 + i)] = m[((m.length - 1) - i)]
m[((m.length - 1) - i)] = n
i++
}
return m
}
let t;
for(let i = 0; i < x.length / 2 ; i++){
t = x[i];
x[i] = x[x.length-1-i];
x[x.length-1-i] = t;
}
}
let buf;
for (let i = 0; i < arr.length/2; i++) {
buf = arr[i];
arr[i] = arr[arr.length - 1 - i];
arr[arr.length - 1 - i] = buf;
}
}
for (let i = 0, k = a.length-1; k-i>=1; i++, k--){
let v = a[i]
a[i] = a[k]
a[k] = v
}
}
for(let i=0;i< arr.length/2;i++){
var k = arr[i];
arr[i] = arr[arr.length-1-i];
arr[arr.length-1-i] = k;
}
return arr
}
let n = m.length-1;
for(let i=0; i<=n/2; i++) {
let temp = m[i];
m[i] = m[n-i];
m[n-i] = temp;
}
}
let a = [1, 2, 3];
myReverse(a);
console.log(a)
for (let i = 0; i < array.length; i++) {
array.splice(i, 0, array.splice(array.length - 1)[0]);
}
}
m.reverse();
}
{
let temp = [...arr];
for(let i = 0; i < arr.length; i++)
arr[i] = temp[temp.length - i - 1];
}
let element = Math.floor(arr.length / 1.3);
while (element > 0) {
for(let i = 0; i + element < arr.length; i++) {
if (arr[i] < arr[i + element]) {
let temporary = arr[i + element];
arr[i + element] = arr[i];
arr[i] = temporary;
}
}
element = Math.floor(element / 1.3);
}
}
let el;
for (let i = 0, g = arr.length - 1; i < g; i++, g--){
el = arr[g];
arr[g] = arr[i];
arr[i] = el;
}
}
m.reverse ( );
}
let arrItem = a.length;
let b = 0;
for (let i = (arrItem - 1); i >= 0; i--) {
a[arrItem + b] = a[i]
b++
}
a = a.splice(0, arrItem);
}
for (let i = 0; i < arr.length / 2; i++) {
let temp = arr[i];
arr[i] = arr[arr.length - 1 - i];
arr[arr.length - 1 - i] = temp;
}
}
{
for (let n = 0; n <= m.length; n = n + 1)
{
m.splice( n, 0, m.pop())
}
return m;
}
let temporaryElement;
for(let i=0,j=arr.length-1; i< j; i++,j--){
temporaryElement = arr[j];
arr[j] = arr[i];
arr[i] = temporaryElement;
}
}
for (let i = 0, j = arr.length - 1; i< arr.length/2; i++, j-- ) {
let save = arr[i];
arr[i]=arr[j];
arr[j]=save;
}
}
for (let i = 0; i < m.length/2; i++) {
glass = m[i]
m[i]=m[m.length-1-i]
m[m.length-i-1]=glass
}
}
let box;
for(let i = 0; i < arr.length/2; i++){
box = arr[i];
arr[i] = arr[arr.length - 1 - i];
arr[arr.length - 1 - i] = box;
}
}
arr.reverse();
}
a.reverse();
}
for (let i = 0; i < arr.length / 2; i++) {
let temp = arr[i];
let backIndex = arr.length - i - 1;
arr[i] = arr[backIndex];
arr[backIndex] = temp;
}
return arr;
}
let index;
for(let i=0,j=m.length-1; i< j; i++,j--){
index = m[j];
m[j] = m[i];
m[i] = index;
}
return m;
}
let k = m.length-1;
for (; k >= 0; k--){
m.push(m[k]);
}
for (let i = m.length/2; i > 0; i--){
m.shift();
}
return m;
}
for(let i = 0;i !== arr.length - i - 1;i++){
[arr[i],arr[arr.length - i - 1]] = [arr[arr.length - i - 1],arr[i]]
}
}
for(let i = 0; i< arr.length/2; i++){
var k = arr[i];
arr[i] = arr[arr.length-1-i];
arr[arr.length-1-i] = k;
}
return arr
}
arr = []
for(let i = 0;i< array.length;i++){
arr[i] = array[(array.length - 1) - i]
}
for(let i = 0;i< arr.length;i++){array[i]=arr[i]}
return arr
}
{
for(let i=0;i< m.length;i++)
{
m.splice(i,0,m.pop())
}
}
for(let i = 0; i < arr.length; i++) {
arr.splice(i,0,arr.pop())
}
}
{
for (let i = 0, j = a.length - 1; i < a.length / 2; i++, j--)
{
let tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
}
for (let i = 0; i < arr.length / 2; i++) {
let temp = arr[i];
let backIndex = arr.length - i - 1;
arr[i] = arr[backIndex];
arr[backIndex] = temp;
}
return arr;
}
let m = arr.length - 1;
for(let i = 0; i <= m/2; i++) {
let k = arr[i];
arr[i] = arr[m - i];
arr[m - i] = k;
}
}
let n = m.length;
for(let i = 0; i < n; i++){
m.push(m[n - (1 + i)]);
}
m.splice(0, n);
}
for(let i = 0, j = a.length - 1; i < j; i++, j--){
let n = a[i];
let m = a[j];
a.splice(i, 1, m);
a.splice(j, 1, n);
}
return a;
}
{
m.reverse();
}
for (let i = 0; i < arr.length / 2; i++) {
let temp = arr[i];
let backIndex = arr.length - i - 1;
arr[i] = arr[backIndex];
arr[backIndex] = temp;
}
return arr;
}
for (let i = 0; i < arr.length / 2; i++) {
let temp = arr[i];
let backIndex = arr.length - i - 1;
arr[i] = arr[backIndex];
arr[backIndex] = temp;
}
return arr;
}
{
return m.reverse();
}
for (let i = 0; i < arr.length / 2; i++) {
let temp = arr[i];
let backIndex = arr.length - i - 1;
arr[i] = arr[backIndex];
arr[backIndex] = temp;
}
return arr;
}
let N = arr.length;
for(let i = 0; i< N/2; i++)
[arr[i], arr[N-1-i]]=[arr[N-1-i],arr[i] ];
}
for(let i = 0; i< m.length / 2; i++){
console.log(`${i} : ${m.length - i - 1}`);
[m[i], m[m.length - i - 1]] = [ m[m.length - i - 1], m[i]];
}
}
const shadow = Array.from(arr)
for (let i = 0; i < shadow.length; i++) {
arr[i] = shadow[shadow.length - i - 1]
}
}
for(let i = 0,j = a.length - 1;i< j;i++,j--){
let n = a[i];
let m = a[j];
a.splice(i, 1, m);
a.splice(j, 1, n);
}
return a;
}
Визначте функцію myReverse, яка отримує довільний масив
та перебудовує його елементи у зворотному порядку.
Функція нічого не повертає, лише змінює свій аргумент.
Не використовуйте метод reverse.
*/
//BEGIN
function myReverse(m) {
for (let i = 0, j = m.length - 1; i < j; i += 1, j -= 1) {
let t = m[i]; m[i] = m[j]; m[j] = t;
}
if (m==0){
m = 0
}
}
for(let i=0; i
return m;
}
let temp = 0;
for(let i = 0, j = arr.length-1; i < j; i++,j--) {
temp = arr[j];
arr[j] = arr[i];
arr[i] = temp;
}
}
array.reverse()
}
{
let i = 0;
let j = arr.length - 1;
while(i < arr.length / 2 + 1 && j > arr.length / 2 - 1)
{
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
i++;
j--;
}
return arr;
}
for(let i = 0; i < m.length / 2; i++){
let t;
t = m[i];
m[i] = m[m.length - i - 1];
m[m.length - i - 1] = t;
}
}
for(let i = arr.length - 1; i >= 0; i--){
arr.push(arr[i]);
}
arr.splice(0, arr.length/2);
}
for (let i = 0; i <= n.length / 2; i++) {
c = n[i]
n[i] = n[n.length - i - 1]
n[n.length - i - 1] = c
}
return n
}
for (let i = 0; i <= n.length / 2; i++) {
c = n[i]
n[i] = n[n.length - i - 1]
n[n.length - i - 1] = c
}
return n
}
for (let i = 0; i < (m.length/2); i++){
let c = m[i];
m[i]=m[m.length - 1 - i];
m[m.length - 1 - i] = c;
}
}
let size = m.length;
let half = size >> 1;
for(let i = 0; i < half; i++){
let tmp = m[i];
m[i] = m[size - i - 1];
m[size - i - 1] = tmp;
}
}
for (let i=0, n; i< arr.length/2; i++){
n=arr[i];
arr[i]=arr[arr.length-1-i];
arr[arr.length-1-i]=n;
}
return;
}
for(let i = 0; i < Math.floor(arr.length / 2); i++) {
let temp = arr[i];
arr[i] = arr[arr.length - 1 - i];
arr[arr.length - 1 - i] = temp;
}
}
for(let i=m.length-1; i >= 0; i--){
m.push(m[i]);
}
m.splice(0, m.length/2);
return m;
}
{
for(let i=0;i< m.length;i++)
{
m.splice(i,0,m.pop())
}
}
for (let i = 0, j = m.length - 1; i < j; i++, j--) {
[m[i], m[j]] = [m[j], m[i]];
}
return m;
}
let arr = [];
for(let i = 0,j=a.length-1;i< a.length;i++,j--){
arr[i]=a[j];
}
for(let i = 0;i< arr.length;i++){a[i]=arr[i]}
}
let t = m.slice();
for(k = 1; k <= m.length; k++){
let x = t[t.length-k];
m.splice([k]-1,1,x);
}
return m;
}
{
for(let i = 0; i < a.length/2; i++)
{
let t = a[i]
a.splice(i,1,a[a.length - 1 - i])
a.splice(a.length - 1 - i,1,t)
}
return(a)
}