Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2) b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145 Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2) 2 57 88 70 135 Write a program to test the function you designed. Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).

Sorting ascends if a list is empty or all items except the last are less than or equal to their successors. Define isSorted to return True if a list is sorted and False otherwise. (Hint: Loop through a list of length 2 or more and compare pairs of items left to right, returning False if the first item is greater.) Main function output: def main(): Print (isSorted(lyst)) lyst = [1] print(isSorted(lyst)) Lyst list(range(10)) print(isSorted(lyst)) lyst[9]=3 print(isSorted(lyst)) %3D True False

Using the function provided, write a function that decides whether two lists are "identical". That is, if cycling by any number N makes the lists identical, the function should return True, otherwise, it should return False. for example identical([1,2,3,4,5], [5,4,1,2,3,]) should give True and identical([1,2,3,4,5,6], [1,2,3,5,4]) should give False.

Python help

Write a function named merge-sort in Scheme that takes a list of integers as input and returns a sorted list. (Hint: Use the merge and split-list methods that you just wrote. You will have to cut-and-paste the code into your answer.) For example, (merge-sort '(5 3 1 2 4)) should return '(1 2 3 4 5) • (every-other '()) should return '()

3 2 5 6 4 1   In each blank, enter the list after the given iteration. Put one space between each pair of numbers. Do not put commas or any other character in your response besides the numbers and spaces. Do not put a space at the beginning or end of your response. What will the list be after the first iteration of selection sort? incorrect   What will the list be after the second iteration of selection sort? incorrect   What will the list be after the third iteration of selection sort? incorrect   What will the list be after the fourth iteration of selection sort?

have been given a singly linked list of integers. Write a function that returns the index/position of integer data denoted by 'N' (if it exists). Return -1 otherwise. Note :Assume that the Indexing for the singly linked list always starts from 0.Input format :The first line contains an Integer 'T' which denotes the number of test cases. The first line of each test case or query contains the elements of the singly linked list separated by a single space. The second line contains the integer value 'N'. It denotes the data to be searched in the given singly linked list. Remember/Consider :While specifying the list elements for input, -1 indicates the end of the singly linked list and hence -1 would never be a list element. Output format :For each test case, return the index/position of 'N' in the singly linked list. Return -1, otherwise. Output for every test case will be printed in a separate line. Note:You do not need to print anything; it has already been taken care of. Just implement…

This is for Python version 3.8.5 and please include pseudocode.  nums = [8, 15, 6, 17, 33, 20, 14, 9, 12]Write Python code that: uses a function to print the size of the list named nums uses a function to print the largest number in nums prints the element 14 by using its index makes a slice named subnums containing only 33, 20, and 14

Write a version of the sequential search algorithm that can be used to search a sorted list. Write a program to test the sequential search algorithm. Use either the function bubbleSort or insertionSort to sort the list before the search. Your program should prompt the user to enter 10 digits and then prompt the user to enter a digit to search - if the list contains this digit, output its position to the console: x is found at position y If the digit is not contained in the list, output the following: x is not in the list

I need to find the asnwer to this question I do have the code from the lab before I just need to know how to add that one to the other code. 3.9 LAB: Smallest and largest numbers in a list using min and max built-in functions   NOTE1: Please make sure you complete previous lab successfully before you proceed with this Lab assignment NOTE2: Make sure to copy and past your code from previous lab into here and update it to complete this lab Write a program that reads a list of integers into a list as long as the integers are greater than zero, then outputs the list values and the smallest and largest integers in the list using min and max built-in functions . Ex: If the input is: 10 5 3 21 2 -6 the output is: [10, 5, 3, 21, 2] 2 and 21   This is the code of the lab before that wants me to add to it.