Below is a Python function definition for a linear search of a list Ist for element. It returns the first index at which element can be found in the list (or None) if element is not in the list. def linearSearch(1st, element): i = e for item in 1st: if element == item: return i else: i += 1 return None Write a similar MATLAB function linearSearch.m. Your MATLAB function should take as parameters an unsorted list of non-negative integers, and an integer value, and returns the index where that value is first located in the list. (No argument testing is required.) Unlike the Python code which returns None if the value is not in the array, your MATLAB function should return the value -1 if the value is not found.

Below is a Python function definition for a linear search of a list Ist for element. It returns the first index at which element can be found in the list (or None) if element is not in the list. def linearSearch(1st, element): i = e for item in 1st: if element == item: return i else: i += 1 return None Write a similar MATLAB function linearSearch.m. Your MATLAB function should take as parameters an unsorted list of non-negative integers, and an integer value, and returns the index where that value is first located in the list. (No argument testing is required.) Unlike the Python code which returns None if the value is not in the array, your MATLAB function should return the value -1 if the value is not found.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

In a programing language using OCaml do the following: Use the built-in higher order functions2 and write a non-recursive function val cart_fun : (’a -> ’b -> ’c) -> ’a list -> ’b list -> ’c list = which takes a function, and two lists as an input, and returns a third list which contains the result of the function applied on all possible pairs of elements from both input lists. # cart_fun ( * ) [1;2;2;6;3;9;1] [2;3];; - : int list = [2; 3; 4; 6; 4; 6; 12; 18; 6; 9; 18; 27; 2; 3]
Help writing an emacs/lisp function Write a function that takes one parameter that is a list of numbers and returns true (t) if all the elements of the list are multiples of the first one and nil otherwise. This said, a list generated by the function make-multiples could be passed to this new function and the result should be true. On the other hand, show an example of a list that could not have been generated by the first function for which the result is still true.
OCAML programming language Cartesian map Use the built-in higher order functions and write a non-recursive functionval cart_fun : ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list = <fun> which takes a function, and two lists as an input, and returns a third list whichcontains the result of the function applied on all possible pairs of elements from both input lists. # cart_fun ( * ) [1;2;2;6;3;9;1] [2;3];;- : int list = [2; 3; 4; 6; 4; 6; 12; 18; 6; 9; 18; 27; 2; 3]
Write a function in c programming language that gets an array of points ( function is defined as : typedef struct{ int x; Int y; } point; ) and sorts the array using qsort().Given two points a=(ax,ay) and b=(bx,by) we compare them as follows: 1) if (ax)2+(ay)2 < (bx)2+(by)2, then a should come before b in the sorted array. 2) if (ax)2+(ay)2 = (bx)2+(by)2, then we compare the points by the x coordinate. Remark: For a point a=(ax,ay) the quantity ((ax)2+(ay)2)1⁄2 is the distance of a from the (0,0). That is, we sort the points according to their distance to (0,0), and if for points at the same distance, then we sort them according to the first coordinate. You will need to implement the comparison function, and apply qsort() on the array with this comparison function. For example: - Input: [(3,2), (7,1), (1,1), (3,4), (5,0), (7,1)] - Expected output: [(1,1), (3,2), (3,4), (5,0), (7,1), (7,1) ] Explanation:(1,1) is first because 12+12=2 is the smallest(3,2)…
Write a python function called rem_duplicate that takes a tuple in the parameter and return a tuple removing all the duplicate values. Then print the returned tuple in the function call. ===================================================== Hints: Unlike lists, tuples are immutable so, the tuple taken as an argument cannot be modified. But list can be modified and lastly for returning the result use type conversion. You need to use membership operators (in, not in) for preventing adding any duplicates values. ===================================================== Example1: Function Call: rem_duplicate((1,1,1,2,3,4,5,6,6,6,6,4,0,0,0)) Output: (1, 2, 3, 4, 5, 6, 0) ==================================== Example2: Function Call: rem_duplicate(("Hi", 1, 2, 3, 3, "Hi",'a', 'a', [1,2])) Output: ('Hi', 1, 2, 3, 'a', [1, 2])
Write a function that takes a matrix of order 3 and prints the transpose of it. The transpose should be stored in a different matrix.Test the function in main().For example:Matrix =1 2 34 5 67 8 9Transpose =1 4 72 5 83 6 9 write code for it in c++
Using c++ An Unsorted Type ADT is to be extended by the addition of functionSplitLists, which has the following specifications:Function: Divides list into two lists according to the key of item.Preconditions: list has been initialized and is not empty.Postconditions: list1 contains all the items of list whose keys are less than orequal to item’s key; list2 contains all the items of list whose keys are greaterthan item’s key.b. Implement SplitLists as a linked member function of the Unsorted
I need help writing an emacs/lisp function Write a function that takes one parameter that is a list of numbers and returns true (t) if all the elements of the list are multiples of the first one and nil otherwise. This said, a list generated by the function make-multiples could be passed to this new function and the result should be true. On the other hand, show an example of a list that could not have been generated by the first function for which the result is still true.
This is assignment used C++. Develop a linked-list processing function, IsolateTargetSoloAsTail, to process a linked list as follows. ● If a target cannot be found on the given list, a new node containing the target is created and added to the list's end (made the new tail node). ► This includes the case where the given list is empty, in which the new tail node added is also the new head node. (This is so because the only node in a 1-node list is the list's head and tail node.) ● If the target appears only once on the given list, the target-matching node is moved to the list's end (made the new tail node). ► Nothing needs to be done if the target-matching node is already the tail node (of the given list). ● If the target appears multiple times on the given list, the first target-matching node is moved to the list's end (made the new tail node), and all other target-matching nodes are to be deleted from the list. ► Note that although…
In C++ Question A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example: head refers to the list of nodes 1 → 2 → 3 → 1 → NULL. There is a cycle where node 3 points back to node 1, so return 1. Function Description: Complete the has cycle function provided in the moodle assignment folder. It has the following parameter: • SinglyLinkedListNode pointer head: a reference to the head of the list. Returns: • int: 1 if there is a cycle or 0 if there is not. Note: if the list is empty, head will be null. Input Format: The code stub reads from stdin and passes the appropriate argument to your function. The custom test cases format will not be described for this question due to its complexity. Expand the section for the main function and review the code if you would like to figure out how to create…
emacs/lisp function Write a function that takes one parameter that is a list of numbers and returns true (t) if all the elements of the list are multiples of the first one and nil otherwise. This said, a list generated by the function make-multiples could be passed to this new function and the result should be true. On the other hand, show an example of a list that could not have been generated by the first function for which the result is still true.
Define a recursive function named trim; it takes as its arguments a linked list (the head node of it) and a non-negative integer representing the index of an element in the list. The function mutates the linked list such that all elements that occur after the index is removed. Additionally, the function returns a linked list of all the elements that were moved. If the index value exceeds the length of the linked list, it should raise an IndexError. For example, if we defined a list as l1 = LN(1, LN(2, LN 3))) , calling the function would return the linked list LN(2, LN(3)), and the mutated l1 would become LN(1). You must use recursion. def trim(l: LN, index: int) -> LN: