Данный отчёт сгенерирован 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
Описание: Запишіть у рекурсивній формі алгоритм послідовного пошуку у масиві.
З цією метою визначте функцію serialSearch, яка приймає значення, що шукають, (ключ) та масив.
Функція повертає індекс першого входження ключа масив. Якщо ключа в масиві немає, функція повертає -1.
Чи не використовувати while, for.
10.02.2023 18:21:31
Решений: 32
10.02.2023 18:21:31
Послідовний пошук у масиві
10.02.2023 18:21:31
function serialSearch(key, arr, counter=0){
if(key == arr[counter]) return counter
if(counter > arr.length) return -1
return serialSearch(key,arr,counter+=1)
}
function serialSearch(key, arr, a=0){
if(arr[0]==key){
return a
}
if(arr.length == 0){
return -1
}
arr.splice(0,1)
a++
return serialSearch(key,arr, a)
}
function serialSearch(key, arr,x=0){
if (x===arr.length){
return -1
}
if (arr[x]===key){
return x
}
x=x+1
return serialSearch(key,arr,x)
}
function serialSearch(key, arr)
{
if (arr[arr.length - 1] == key)
return arr.length - 1;
else if (arr == false)
return -1;
return serialSearch(key, arr.slice(0, arr.length - 1))
}
function serialSearch(key, arr, index = 0)
{
if(arr[index]==key) return index;
else if(index==arr.length-1) return -1;
return serialSearch(key,arr,index+1);
}
function serialSearch(key, arr)
{
let result = arr.indexOf(key)
return result
}
function serialSearch(k, a) {
if(a.length == 0)
return -1;
if(a[0] == k)
return 0;
let r = serialSearch(k, a.slice(1));
if(r == -1)
return -1;
return 1 + r;
}
function serialSearch(key, arr,i=0){
if(arr.length===0){
return -1
}
if(arr[0]===key){
return i
}
return serialSearch(key, arr.slice(1), i+1)
}
function serialSearch(key, arr){
if (arr.length == 0) return -1;
if (arr[0] == key) return 0;
if (serialSearch(key, arr.slice(1)) == -1) return -1;
return serialSearch(key, arr.slice(1)) + 1;
}
function serialSearch(key, arr, k = 0){
if(arr[k] == key) return k;
if(k < arr.length){
return serialSearch(key, arr, k+1);
}else {
return -1;
}
}
function serialSearch (key, arr) {
return arr.indexOf(key)
}
function serialSearch(key, array) {
let i = 0;
while (i < array.length) {
if (array[i] === key) {
return i;
}
i++;
}
return -1;
}
function serialSearch(key,arr,i = 0){
return (arr[i] == key )? i : (i == arr.length)? -1 : serialSearch(key, arr,i + 1)
}
function serialSearch(key, arr, i=0) {
if(arr.length == 0)
return -1;
if(arr[0] == key)
return i;
return serialSearch(key, arr.splice(1), i+1);
}
function serialSearch(key, array, index = 0) {
if (index === array.length) {
return -1;
} else if (array[index] === key) {
return index;
} else {
return serialSearch(key, array, index + 1);
}
}
function serialSearch(key, arr) {
let i = arr.indexOf(key)
if (i == -1) return -1;
if (i !== -1) return i;
return serialSearch(key, arr);
}
function serialSearch(key, arr) {
if(arr[arr.length - 1] === key)
return arr.length - 1;
arr.pop();
if(arr.length == 0)
return -1;
return serialSearch(key, arr)
}
function serialSearch(key, arr){
let a=arr.indexOf(key)
if (a==-1){
return -1;
}
if (a!==-1){
return a;
}
return serialSearch(key, arr);
}
function serialSearch(key, arr) {
function next(i) {
if (arr[i] == key) {
return i;
} else if (i == arr.length - 1) {
return -1;
} else {
return next(i + 1);
}
}
return next(0);
}
function serialSearch(key, arr, i = 0) {
if(arr.length == 0)
return -1;
if(arr[0] == key)
return i;
return serialSearch(key, arr.splice(1), i+1);
}
function serialSearch (key, array, i = 0) {
if (i >= array.length) {
return -1;
}
if (array[i] === key) {
return i;
}
else {
return serialSearch (key, array, i+1);
}
}
function serialSearch(key, arr, i=0) {
if(arr.length == 0)
return -1;
if(arr[0] == key)
return i;
return serialSearch(key, arr.splice(1), i+1);
}
function serialSearch(key, arr){
let i =0;
let res = -1;
f(key, arr);
function f(key, arr){
if(arr[i] == key){
res = i;
return res;
}
i++;
if(i < arr.length){
f(key, arr);
}
return res;
}
return res;
}
function serialSearch(key, arr, ind = 0) {
if (arr.length === 0) return -1;
else if(arr[0] === key) return ind;
return serialSearch(key, arr.splice(1), ind+1);
}
function serialSearch (key, arr) {
return arr.indexOf(key)
}
function serialSearch(key, arr) {
let i = arr.indexOf(key)
return (i!=-1) ? i:-1;
}
function serialSearch(key, arr){
let b = c();
if (arr.length == 0){
return -1}
else
{return b};
function c(){
if (arr.length == 0) {
return -1
}
else
if (arr[0] === key){
return 0;
}
else {
arr = arr.slice(1)
return 1 + c()
}
}
}
function serialSearch(key, arr, ind = 0){
if (ind < arr.length){
if (arr[ind] === key) return ind
return serialSearch(key, arr, ind + 1)
}
return -1
}
function serialSearch(key, arr, indx = 0){
if (arr.length == 0) return -1;
else if (arr[0] == key) return indx;
else{
arr.splice(0, 1);
indx++;
return serialSearch(key, arr, indx);
}
}
const serialSearch=(key, arr)=>arr.indexOf(key)
function serialSearch(key, arr,i=0){
if(arr.length===0){
return -1
}
if(arr[0]===key){
return i
}
return serialSearch(key, arr.slice(1), i+1)
}
function serialSearch(key, arr, index = 0) {
if (index >= arr.length) {
return -1;
} else if (arr[index] === key) {
return index;
} else {
return serialSearch(key, arr, index + 1);
}
}
if(key == arr[counter]) return counter
if(counter > arr.length) return -1
return serialSearch(key,arr,counter+=1)
}
if(arr[0]==key){
return a
}
if(arr.length == 0){
return -1
}
arr.splice(0,1)
a++
return serialSearch(key,arr, a)
}
if (x===arr.length){
return -1
}
if (arr[x]===key){
return x
}
x=x+1
return serialSearch(key,arr,x)
}
{
if (arr[arr.length - 1] == key)
return arr.length - 1;
else if (arr == false)
return -1;
return serialSearch(key, arr.slice(0, arr.length - 1))
}
{
if(arr[index]==key) return index;
else if(index==arr.length-1) return -1;
return serialSearch(key,arr,index+1);
}
{
let result = arr.indexOf(key)
return result
}
if(a.length == 0)
return -1;
if(a[0] == k)
return 0;
let r = serialSearch(k, a.slice(1));
if(r == -1)
return -1;
return 1 + r;
}
if(arr.length===0){
return -1
}
if(arr[0]===key){
return i
}
return serialSearch(key, arr.slice(1), i+1)
}
if (arr.length == 0) return -1;
if (arr[0] == key) return 0;
if (serialSearch(key, arr.slice(1)) == -1) return -1;
return serialSearch(key, arr.slice(1)) + 1;
}
if(arr[k] == key) return k;
if(k < arr.length){
return serialSearch(key, arr, k+1);
}else {
return -1;
}
}
return arr.indexOf(key)
}
let i = 0;
while (i < array.length) {
if (array[i] === key) {
return i;
}
i++;
}
return -1;
}
return (arr[i] == key )? i : (i == arr.length)? -1 : serialSearch(key, arr,i + 1)
}
if(arr.length == 0)
return -1;
if(arr[0] == key)
return i;
return serialSearch(key, arr.splice(1), i+1);
}
if (index === array.length) {
return -1;
} else if (array[index] === key) {
return index;
} else {
return serialSearch(key, array, index + 1);
}
}
let i = arr.indexOf(key)
if (i == -1) return -1;
if (i !== -1) return i;
return serialSearch(key, arr);
}
if(arr[arr.length - 1] === key)
return arr.length - 1;
arr.pop();
if(arr.length == 0)
return -1;
return serialSearch(key, arr)
}
let a=arr.indexOf(key)
if (a==-1){
return -1;
}
if (a!==-1){
return a;
}
return serialSearch(key, arr);
}
function next(i) {
if (arr[i] == key) {
return i;
} else if (i == arr.length - 1) {
return -1;
} else {
return next(i + 1);
}
}
return next(0);
}
if(arr.length == 0)
return -1;
if(arr[0] == key)
return i;
return serialSearch(key, arr.splice(1), i+1);
}
if (i >= array.length) {
return -1;
}
if (array[i] === key) {
return i;
}
else {
return serialSearch (key, array, i+1);
}
}
if(arr.length == 0)
return -1;
if(arr[0] == key)
return i;
return serialSearch(key, arr.splice(1), i+1);
}
let i =0;
let res = -1;
f(key, arr);
function f(key, arr){
if(arr[i] == key){
res = i;
return res;
}
i++;
if(i < arr.length){
f(key, arr);
}
return res;
}
return res;
}
if (arr.length === 0) return -1;
else if(arr[0] === key) return ind;
return serialSearch(key, arr.splice(1), ind+1);
}
return arr.indexOf(key)
}
let i = arr.indexOf(key)
return (i!=-1) ? i:-1;
}
let b = c();
if (arr.length == 0){
return -1}
else
{return b};
function c(){
if (arr.length == 0) {
return -1
}
else
if (arr[0] === key){
return 0;
}
else {
arr = arr.slice(1)
return 1 + c()
}
}
}
if (ind < arr.length){
if (arr[ind] === key) return ind
return serialSearch(key, arr, ind + 1)
}
return -1
}
if (arr.length == 0) return -1;
else if (arr[0] == key) return indx;
else{
arr.splice(0, 1);
indx++;
return serialSearch(key, arr, indx);
}
}
if(arr.length===0){
return -1
}
if(arr[0]===key){
return i
}
return serialSearch(key, arr.slice(1), i+1)
}
if (index >= arr.length) {
return -1;
} else if (arr[index] === key) {
return index;
} else {
return serialSearch(key, arr, index + 1);
}
}