Algorithm Name,Algorithm Type,Time Complexity,Space Complexity,Data Structure,Algorithm Paradigm,Input Requirement,Worst Case Complexity,Average Case Complexity,Best Case Complexity,Iterative/Recursive,Use Cases,Question,Input,Expected Output,Algorithm in Python,Python Code Snippet,Difficulty Level Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 27 in the following list: [-99, -96, -94, -93, -64, -60, -58, -42, -41, -37, -26, -17, -15, -14, -12, -3, -2, -1, 2, 7, 10, 14, 21, 30, 34, 41, 42, 46, 52, 55, 64, 78, 82, 84, 93, 96, 97, 111, 113, 127, 135, 143, 144].","[-99, -96, -94, -93, -64, -60, -58, -42, -41, -37, -26, -17, -15, -14, -12, -3, -2, -1, 2, 7, 10, 14, 21, 30, 34, 41, 42, 46, 52, 55, 64, 78, 82, 84, 93, 96, 97, 111, 113, 127, 135, 143, 144], 27",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 74 exists in [-88, -48, -31, -18, -13, -4, 5, 56, 86, 107, 118, 126, 128, 134].","[-88, -48, -31, -18, -13, -4, 5, 56, 86, 107, 118, 126, 128, 134], 74",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 34 in the list [-95, -93, -92, -88, -86, -82, -77, -76, -74, -69, -63, -60, -56, -48, -46, -38, -31, -24, -23, -17, -15, -11, -9, -1, 0, 4, 13, 14, 19, 20, 23, 30, 32, 49, 54, 56, 57, 65, 66, 68, 69, 70, 89, 99, 108, 119, 125, 127, 133, 142].","[-95, -93, -92, -88, -86, -82, -77, -76, -74, -69, -63, -60, -56, -48, -46, -38, -31, -24, -23, -17, -15, -11, -9, -1, 0, 4, 13, 14, 19, 20, 23, 30, 32, 49, 54, 56, 57, 65, 66, 68, 69, 70, 89, 99, 108, 119, 125, 127, 133, 142], 34",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 92 in the following list: [-93, -76, -60, -35, -21, -2, 4, 16, 46, 60, 82, 103, 106, 118].","[-93, -76, -60, -35, -21, -2, 4, 16, 46, 60, 82, 103, 106, 118], 92",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 97 appear in [-99, -98, -95, -93, -89, -88, -83, -81, -79, -76, -73, -72, -69, -60, -59, -53, -46, -30, -23, -17, -11, 15, 18, 29, 36, 40, 46, 53, 61, 64, 65, 66, 80, 87, 90, 94, 97, 101, 105, 109, 113, 114, 118, 122, 126, 129, 135, 136, 143]? Use linear search to check.","[-99, -98, -95, -93, -89, -88, -83, -81, -79, -76, -73, -72, -69, -60, -59, -53, -46, -30, -23, -17, -11, 15, 18, 29, 36, 40, 46, 53, 61, 64, 65, 66, 80, 87, 90, 94, 97, 101, 105, 109, 113, 114, 118, 122, 126, 129, 135, 136, 143], 97",Element found at index 36,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 81 appear in [-91, -85, -76, -74, -55, -52, -45, -44, -41, -28, -27, -25, -20, -10, -6, -4, -1, 1, 2, 7, 8, 16, 20, 21, 22, 71, 73, 77, 82, 95, 101, 115, 148]? Use linear search to check.","[-91, -85, -76, -74, -55, -52, -45, -44, -41, -28, -27, -25, -20, -10, -6, -4, -1, 1, 2, 7, 8, 16, 20, 21, 22, 71, 73, 77, 82, 95, 101, 115, 148], 81",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -2 appear in [-98, -96, -89, -84, -79, -74, -69, -58, -50, -42, -38, -37, -31, -29, -21, -20, -12, 16, 17, 29, 31, 48, 53, 66, 74, 85, 91, 96, 115, 128, 134, 142, 146]? Use linear search to check.","[-98, -96, -89, -84, -79, -74, -69, -58, -50, -42, -38, -37, -31, -29, -21, -20, -12, 16, 17, 29, 31, 48, 53, 66, 74, 85, 91, 96, 115, 128, 134, 142, 146], -2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -45 in the following list: [-93, -84, -80, -45, -15, -3, 26, 32, 54, 69, 104, 143].","[-93, -84, -80, -45, -15, -3, 26, 32, 54, 69, 104, 143], -45",Element found at index 3,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 81 exists in [-2, 21, 98, 103, 107, 116, 121].","[-2, 21, 98, 103, 107, 116, 121], 81",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -44 exists in [-90, -53, -28, -17, -10, 17, 19, 58, 79, 91, 92, 97, 113, 131, 142].","[-90, -53, -28, -17, -10, 17, 19, 58, 79, 91, 92, 97, 113, 131, 142], -44",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 70 in the following list: [-83, -80, -77, -73, -70, -66, -63, -56, -52, -50, -34, -26, -24, -22, -21, -7, -5, 5, 7, 13, 18, 21, 29, 40, 47, 48, 50, 51, 59, 62, 70, 72, 73, 82, 90, 94, 103, 106, 107, 110, 113, 119, 131, 137, 138, 149].","[-83, -80, -77, -73, -70, -66, -63, -56, -52, -50, -34, -26, -24, -22, -21, -7, -5, 5, 7, 13, 18, 21, 29, 40, 47, 48, 50, 51, 59, 62, 70, 72, 73, 82, 90, 94, 103, 106, 107, 110, 113, 119, 131, 137, 138, 149], 70",Element found at index 30,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -40 in the array [-84, -69, -31, -10, 46, 60, 121, 146].","[-84, -69, -31, -10, 46, 60, 121, 146], -40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -42 exists in [-97, -28, -27, 3, 7, 8, 11, 33, 41, 52, 69, 92, 105, 108, 117, 125, 139, 141, 148].","[-97, -28, -27, 3, 7, 8, 11, 33, 41, 52, 69, 92, 105, 108, 117, 125, 139, 141, 148], -42",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 83 in the following list: [-95, -89, -76, -66, -60, -50, -45, -36, -8, -3, -2, 4, 11, 12, 41, 47, 51, 58, 69, 85, 87, 91, 97, 103, 123, 125, 127, 149].","[-95, -89, -76, -66, -60, -50, -45, -36, -8, -3, -2, 4, 11, 12, 41, 47, 51, 58, 69, 85, 87, 91, 97, 103, 123, 125, 127, 149], 83",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 59 appear in [-86, -79, -74, -67, -61, -57, -54, -45, -31, -29, -27, -4, 3, 7, 13, 27, 30, 34, 38, 47, 58, 75, 85, 104, 109, 138, 145]? Use linear search to check.","[-86, -79, -74, -67, -61, -57, -54, -45, -31, -29, -27, -4, 3, 7, 13, 27, 30, 34, 38, 47, 58, 75, 85, 104, 109, 138, 145], 59",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 80 exists in [-57, -49, 28, 76, 94].","[-57, -49, 28, 76, 94], 80",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 65 exists in [-88, -87, -79, -71, -69, -48, -42, -41, -32, -29, -27, -11, -9, -2, 2, 5, 16, 21, 28, 29, 35, 42, 45, 48, 49, 50, 68, 76, 81, 87, 88, 98, 99, 103, 115, 116, 122, 124, 127, 129, 138, 141, 148].","[-88, -87, -79, -71, -69, -48, -42, -41, -32, -29, -27, -11, -9, -2, 2, 5, 16, 21, 28, 29, 35, 42, 45, 48, 49, 50, 68, 76, 81, 87, 88, 98, 99, 103, 115, 116, 122, 124, 127, 129, 138, 141, 148], 65",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 43 exists in [-88, -9, 28, 67, 128].","[-88, -9, 28, 67, 128], 43",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -28 in the list [-100, -94, -86, -85, -84, -80, -78, -74, -60, -52, -42, -32, -27, -24, -22, -18, -16, -12, -11, -9, -8, -6, -4, 0, 3, 13, 22, 29, 34, 36, 51, 54, 61, 63, 68, 72, 80, 86, 99, 110, 114, 119, 133, 138, 140].","[-100, -94, -86, -85, -84, -80, -78, -74, -60, -52, -42, -32, -27, -24, -22, -18, -16, -12, -11, -9, -8, -6, -4, 0, 3, 13, 22, 29, 34, 36, 51, 54, 61, 63, 68, 72, 80, 86, 99, 110, 114, 119, 133, 138, 140], -28",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 31 in the array [-91, -86, -76, -75, -74, -73, -64, -52, -47, -44, -42, -41, -32, -20, -5, -4, 2, 6, 7, 10, 22, 26, 27, 37, 39, 43, 50, 57, 68, 69, 70, 77, 79, 83, 84, 96, 109, 125, 128, 145].","[-91, -86, -76, -75, -74, -73, -64, -52, -47, -44, -42, -41, -32, -20, -5, -4, 2, 6, 7, 10, 22, 26, 27, 37, 39, 43, 50, 57, 68, 69, 70, 77, 79, 83, 84, 96, 109, 125, 128, 145], 31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -12 in the list [-100, -98, -95, -92, -80, -79, -49, -31, -26, -23, -20, -18, -15, -14, -11, -7, -5, 0, 6, 9, 15, 24, 26, 41, 44, 45, 52, 65, 73, 74, 84, 87, 93, 101, 114, 115, 120, 125, 128, 130, 135, 137, 146, 147].","[-100, -98, -95, -92, -80, -79, -49, -31, -26, -23, -20, -18, -15, -14, -11, -7, -5, 0, 6, 9, 15, 24, 26, 41, 44, 45, 52, 65, 73, 74, 84, 87, 93, 101, 114, 115, 120, 125, 128, 130, 135, 137, 146, 147], -12",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 94 in the list [-73, 56, 78, 105, 114, 148].","[-73, 56, 78, 105, 114, 148], 94",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 0 exists in [-91, -78, -66, -55, -51, -3, 0, 16, 54, 57, 67, 68, 84, 94, 107, 143, 147].","[-91, -78, -66, -55, -51, -3, 0, 16, 54, 57, 67, 68, 84, 94, 107, 143, 147], 0",Element found at index 6,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -34 in the list [-99, -93, -90, -87, -86, -79, -71, -63, -59, -50, -49, -38, -29, -18, -17, -14, 12, 13, 25, 28, 29, 37, 38, 41, 42, 50, 53, 61, 62, 76, 79, 81, 90, 91, 94, 105, 106, 107, 108, 109, 111, 115, 120, 135, 137, 140, 143, 146, 147].","[-99, -93, -90, -87, -86, -79, -71, -63, -59, -50, -49, -38, -29, -18, -17, -14, 12, 13, 25, 28, 29, 37, 38, 41, 42, 50, 53, 61, 62, 76, 79, 81, 90, 91, 94, 105, 106, 107, 108, 109, 111, 115, 120, 135, 137, 140, 143, 146, 147], -34",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 36 exists in [-92, -48, -45, -43, -41, -40, -16, -7, -6, 16, 23, 28, 29, 49, 53, 54, 71, 73, 75, 77, 84, 85, 86, 91, 100, 105, 107, 112, 113, 116, 123, 138, 139, 149].","[-92, -48, -45, -43, -41, -40, -16, -7, -6, 16, 23, 28, 29, 49, 53, 54, 71, 73, 75, 77, 84, 85, 86, 91, 100, 105, 107, 112, 113, 116, 123, 138, 139, 149], 36",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -45 in the array [-57, -54, -42, -9, 7, 10, 27, 35, 47, 65, 69, 92, 105, 107, 117, 132, 139, 143].","[-57, -54, -42, -9, 7, 10, 27, 35, 47, 65, 69, 92, 105, 107, 117, 132, 139, 143], -45",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 93 exists in [-44, -6, 1, 44, 69, 120, 121, 127].","[-44, -6, 1, 44, 69, 120, 121, 127], 93",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -18 in the following list: [-67, -39, -20, 27, 71, 101, 114, 132, 133].","[-67, -39, -20, 27, 71, 101, 114, 132, 133], -18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 65 in the following list: [-99, -98, -95, -90, -75, -67, -64, -60, -49, -48, -35, -26, -21, -20, -8, 6, 7, 9, 12, 13, 14, 31, 46, 50, 51, 58, 59, 63, 85, 95, 99, 102, 104, 113, 122, 126, 132, 137].","[-99, -98, -95, -90, -75, -67, -64, -60, -49, -48, -35, -26, -21, -20, -8, 6, 7, 9, 12, 13, 14, 31, 46, 50, 51, 58, 59, 63, 85, 95, 99, 102, 104, 113, 122, 126, 132, 137], 65",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -12 in the following list: [-100, -82, -75, -48, -14, -7, -5, 3, 10, 23, 25, 35, 40, 47, 50, 59, 62, 63, 67, 85, 98, 116, 135].","[-100, -82, -75, -48, -14, -7, -5, 3, 10, 23, 25, 35, 40, 47, 50, 59, 62, 63, 67, 85, 98, 116, 135], -12",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 67 in the list [-95, -92, -88, -84, -76, -75, -72, -71, -69, -67, -64, -62, -58, -53, -42, -33, -32, -30, -28, -16, 5, 14, 15, 17, 18, 20, 27, 31, 33, 42, 46, 61, 63, 67, 73, 75, 78, 87, 91, 93, 97, 102, 106, 108, 120, 128, 134, 141, 146, 148].","[-95, -92, -88, -84, -76, -75, -72, -71, -69, -67, -64, -62, -58, -53, -42, -33, -32, -30, -28, -16, 5, 14, 15, 17, 18, 20, 27, 31, 33, 42, 46, 61, 63, 67, 73, 75, 78, 87, 91, 93, 97, 102, 106, 108, 120, 128, 134, 141, 146, 148], 67",Element found at index 33,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 14 in the array [-97, -91, -89, -82, -79, -78, -68, -67, -66, -55, -50, -41, -35, -32, -22, -19, -14, -11, 1, 6, 11, 12, 14, 17, 18, 24, 32, 33, 37, 41, 54, 57, 61, 65, 67, 75, 87, 88, 89, 92, 94, 109, 110, 111, 118, 124, 128, 129, 133, 139].","[-97, -91, -89, -82, -79, -78, -68, -67, -66, -55, -50, -41, -35, -32, -22, -19, -14, -11, 1, 6, 11, 12, 14, 17, 18, 24, 32, 33, 37, 41, 54, 57, 61, 65, 67, 75, 87, 88, 89, 92, 94, 109, 110, 111, 118, 124, 128, 129, 133, 139], 14",Element found at index 22,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 53 appear in [-100, -98, -93, -88, -83, -77, -73, -72, -61, -60, -54, -46, -45, -44, -24, -14, -12, -8, -2, 3, 10, 22, 27, 28, 31, 32, 46, 48, 51, 59, 61, 64, 68, 71, 76, 77, 81, 84, 87, 88, 94, 97, 106, 125, 130, 133, 136, 139, 147, 149]? Use linear search to check.","[-100, -98, -93, -88, -83, -77, -73, -72, -61, -60, -54, -46, -45, -44, -24, -14, -12, -8, -2, 3, 10, 22, 27, 28, 31, 32, 46, 48, 51, 59, 61, 64, 68, 71, 76, 77, 81, 84, 87, 88, 94, 97, 106, 125, 130, 133, 136, 139, 147, 149], 53",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 54 in the list [-91, -84, -81, -77, -63, -60, -30, -29, -27, -6, 3, 6, 18, 25, 26, 27, 30, 50, 51, 53, 59, 65, 84, 100, 116, 118, 132, 148].","[-91, -84, -81, -77, -63, -60, -30, -29, -27, -6, 3, 6, 18, 25, 26, 27, 30, 50, 51, 53, 59, 65, 84, 100, 116, 118, 132, 148], 54",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 59 appear in [-89, -73, -65, -19, -3, 11, 32, 60, 61, 89, 118, 136, 140]? Use linear search to check.","[-89, -73, -65, -19, -3, 11, 32, 60, 61, 89, 118, 136, 140], 59",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -20 in the list [-89, -75, -57, -48, -39, -29, -28, -20, -3, 12, 14, 24, 28, 53, 61, 89, 93, 106, 115, 116, 117, 127, 138, 149].","[-89, -75, -57, -48, -39, -29, -28, -20, -3, 12, 14, 24, 28, 53, 61, 89, 93, 106, 115, 116, 117, 127, 138, 149], -20",Element found at index 7,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 39 in the following list: [-74, -68, -32, 25, 34, 48, 74, 93, 118, 135].","[-74, -68, -32, 25, 34, 48, 74, 93, 118, 135], 39",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 77 in the array [-82, -62, -59, -56, -55, -41, -34, -32, -24, -18, -15, -7, 4, 5, 26, 27, 31, 35, 41, 47, 66, 67, 82, 88, 107, 109, 115, 118, 121, 136, 142, 148, 149].","[-82, -62, -59, -56, -55, -41, -34, -32, -24, -18, -15, -7, 4, 5, 26, 27, 31, 35, 41, 47, 66, 67, 82, 88, 107, 109, 115, 118, 121, 136, 142, 148, 149], 77",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 96 in the following list: [-99, -81, -72, -50, -39, -37, -16, -15, 42, 53, 73, 77, 80].","[-99, -81, -72, -50, -39, -37, -16, -15, 42, 53, 73, 77, 80], 96",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 3 in the following list: [-100, -95, -76, -67, -59, -56, -54, -23, -11, -9, 1, 2, 14, 31, 43, 67, 75, 80, 84, 85, 88, 100, 116, 130, 133, 138].","[-100, -95, -76, -67, -59, -56, -54, -23, -11, -9, 1, 2, 14, 31, 43, 67, 75, 80, 84, 85, 88, 100, 116, 130, 133, 138], 3",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 8 in the following list: [-91, -89, -84, -81, -80, -79, -69, -67, -56, -51, -36, -32, -24, -19, -14, -11, -5, 1, 6, 7, 8, 10, 21, 23, 24, 36, 40, 53, 55, 58, 61, 66, 68, 83, 87, 92, 95, 96, 103, 107, 111, 113, 124, 126, 137, 138, 139].","[-91, -89, -84, -81, -80, -79, -69, -67, -56, -51, -36, -32, -24, -19, -14, -11, -5, 1, 6, 7, 8, 10, 21, 23, 24, 36, 40, 53, 55, 58, 61, 66, 68, 83, 87, 92, 95, 96, 103, 107, 111, 113, 124, 126, 137, 138, 139], 8",Element found at index 20,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -1 appear in [-55, 16, 41, 43, 78, 117, 120, 129]? Use linear search to check.","[-55, 16, 41, 43, 78, 117, 120, 129], -1",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -42 appear in [-88, -80, -77, -75, -70, -57, -52, -45, -43, -39, -31, -12, -9, -7, -2, 13, 18, 19, 30, 32, 35, 37, 42, 49, 51, 56, 66, 71, 73, 74, 80, 90, 91, 111, 113, 116, 124, 137, 139]? Use linear search to check.","[-88, -80, -77, -75, -70, -57, -52, -45, -43, -39, -31, -12, -9, -7, -2, 13, 18, 19, 30, 32, 35, 37, 42, 49, 51, 56, 66, 71, 73, 74, 80, 90, 91, 111, 113, 116, 124, 137, 139], -42",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 26 in the following list: [-97, -92, -83, -59, -43, -19, 26, 59, 108, 144, 146].","[-97, -92, -83, -59, -43, -19, 26, 59, 108, 144, 146], 26",Element found at index 6,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 57 in the list [-98, -96, -81, -74, -49, -48, -35, -33, -9, -7, 5, 10, 37, 47, 63, 83, 84, 91, 97, 107, 112, 119, 122, 126, 141].","[-98, -96, -81, -74, -49, -48, -35, -33, -9, -7, 5, 10, 37, 47, 63, 83, 84, 91, 97, 107, 112, 119, 122, 126, 141], 57",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 85 exists in [-84, -71, -68, -65, -39, -37, -32, -26, -25, -14, -13, -10, -9, -5, -3, 2, 6, 8, 12, 16, 20, 21, 38, 39, 56, 60, 69, 89, 97, 102, 113, 118, 127, 133, 135, 137, 141].","[-84, -71, -68, -65, -39, -37, -32, -26, -25, -14, -13, -10, -9, -5, -3, 2, 6, 8, 12, 16, 20, 21, 38, 39, 56, 60, 69, 89, 97, 102, 113, 118, 127, 133, 135, 137, 141], 85",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 60 exists in [-93, -90, -81, -72, -66, -64, -48, -43, -38, -12, -8, -6, -1, 8, 38, 39, 49, 50, 65, 67, 69, 73, 93, 97, 112, 116, 120, 140].","[-93, -90, -81, -72, -66, -64, -48, -43, -38, -12, -8, -6, -1, 8, 38, 39, 49, 50, 65, 67, 69, 73, 93, 97, 112, 116, 120, 140], 60",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -41 exists in [-100, -76, -62, -52, -40, -13, -9, 24, 26, 101, 114, 137].","[-100, -76, -62, -52, -40, -13, -9, 24, 26, 101, 114, 137], -41",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 58 in the list [-90, -85, -65, -55, -42, -38, -32, -28, -16, -10, -4, 2, 8, 14, 21, 24, 43, 49, 53, 57, 81, 84, 92, 94, 102, 115, 131, 146].","[-90, -85, -65, -55, -42, -38, -32, -28, -16, -10, -4, 2, 8, 14, 21, 24, 43, 49, 53, 57, 81, 84, 92, 94, 102, 115, 131, 146], 58",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -39 in the list [-96, -94, -81, -70, -65, -53, -49, -34, -21, -12, -9, -6, -5, -2, 17, 26, 32, 38, 39, 52, 57, 59, 67, 76, 98, 102, 104, 109, 121, 131, 137, 140, 141, 146].","[-96, -94, -81, -70, -65, -53, -49, -34, -21, -12, -9, -6, -5, -2, 17, 26, 32, 38, 39, 52, 57, 59, 67, 76, 98, 102, 104, 109, 121, 131, 137, 140, 141, 146], -39",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 69 appear in [-90, -88, -80, -56, -44, -34, -10, -4, 11, 29, 32, 39, 50, 96, 103, 110, 114, 117, 124, 136, 141, 143]? Use linear search to check.","[-90, -88, -80, -56, -44, -34, -10, -4, 11, 29, 32, 39, 50, 96, 103, 110, 114, 117, 124, 136, 141, 143], 69",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 74 in the list [-94, -86, -83, -73, -70, -63, -62, -61, -60, -56, -52, -40, -24, -17, 1, 7, 12, 14, 15, 16, 17, 21, 28, 33, 34, 43, 50, 56, 59, 69, 84, 95, 105, 107, 128, 132, 133, 135, 139, 149].","[-94, -86, -83, -73, -70, -63, -62, -61, -60, -56, -52, -40, -24, -17, 1, 7, 12, 14, 15, 16, 17, 21, 28, 33, 34, 43, 50, 56, 59, 69, 84, 95, 105, 107, 128, 132, 133, 135, 139, 149], 74",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 39 in the following list: [-97, -92, -91, -87, -82, -24, -10, -7, 30, 110, 121, 140, 143, 146].","[-97, -92, -91, -87, -82, -24, -10, -7, 30, 110, 121, 140, 143, 146], 39",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -19 exists in [-89, -88, -84, -80, -76, -71, -64, -59, -47, -46, -45, -42, -41, -26, -16, -12, -7, 0, 14, 23, 26, 27, 28, 50, 53, 58, 65, 77, 79, 83, 99, 107, 113, 115, 116, 121, 123, 124, 126, 128, 129, 146, 148].","[-89, -88, -84, -80, -76, -71, -64, -59, -47, -46, -45, -42, -41, -26, -16, -12, -7, 0, 14, 23, 26, 27, 28, 50, 53, 58, 65, 77, 79, 83, 99, 107, 113, 115, 116, 121, 123, 124, 126, 128, 129, 146, 148], -19",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 18 in the array [-99, -96, -93, -82, -79, -71, -67, -60, -58, -57, -47, -45, -44, -42, -36, -32, -27, -24, -17, -8, -3, 5, 13, 16, 17, 18, 28, 38, 44, 74, 76, 79, 82, 90, 97, 102, 112, 116, 119, 121, 124, 135, 136, 148].","[-99, -96, -93, -82, -79, -71, -67, -60, -58, -57, -47, -45, -44, -42, -36, -32, -27, -24, -17, -8, -3, 5, 13, 16, 17, 18, 28, 38, 44, 74, 76, 79, 82, 90, 97, 102, 112, 116, 119, 121, 124, 135, 136, 148], 18",Element found at index 25,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 59 in the following list: [-99, -45, -44, -31, -30, -5, 29, 63, 100, 125, 128].","[-99, -45, -44, -31, -30, -5, 29, 63, 100, 125, 128], 59",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 84 in the list [-100, -99, -98, -74, -69, -68, -62, -53, -51, -50, -44, -27, -24, -14, -3, 12, 16, 20, 27, 30, 37, 41, 42, 60, 67, 70, 71, 75, 77, 78, 83, 92, 103, 112, 122, 133, 139].","[-100, -99, -98, -74, -69, -68, -62, -53, -51, -50, -44, -27, -24, -14, -3, 12, 16, 20, 27, 30, 37, 41, 42, 60, 67, 70, 71, 75, 77, 78, 83, 92, 103, 112, 122, 133, 139], 84",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 12 in the list [-97, -96, -83, -44, -40, -38, -30, -27, -20, -4, 0, 5, 25, 28, 34, 35, 43, 45, 69, 70, 83, 100, 105, 109, 111, 118, 126, 148, 149].","[-97, -96, -83, -44, -40, -38, -30, -27, -20, -4, 0, 5, 25, 28, 34, 35, 43, 45, 69, 70, 83, 100, 105, 109, 111, 118, 126, 148, 149], 12",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -23 in the array [-79, -76, -75, -71, -66, -63, -39, -34, -33, -24, -13, -12, -6, -3, 5, 7, 11, 20, 30, 33, 42, 77, 89, 95, 109, 110, 118, 122, 127, 141, 142, 146].","[-79, -76, -75, -71, -66, -63, -39, -34, -33, -24, -13, -12, -6, -3, 5, 7, 11, 20, 30, 33, 42, 77, 89, 95, 109, 110, 118, 122, 127, 141, 142, 146], -23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 81 in the following list: [-96, -79, -76, -75, -72, -52, -49, -41, -34, -23, -22, -16, -15, -14, 4, 7, 9, 12, 33, 39, 41, 76, 93, 99, 103, 108, 115, 129, 134, 136, 143, 149].","[-96, -79, -76, -75, -72, -52, -49, -41, -34, -23, -22, -16, -15, -14, 4, 7, 9, 12, 33, 39, 41, 76, 93, 99, 103, 108, 115, 129, 134, 136, 143, 149], 81",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 52 in the list [-100, -70, -66, -59, -51, -44, -23, -17, -12, 0, 3, 10, 14, 15, 34, 37, 38, 53, 56, 57, 58, 65, 97, 99, 108, 111, 115, 118, 123, 131, 137, 145, 147].","[-100, -70, -66, -59, -51, -44, -23, -17, -12, 0, 3, 10, 14, 15, 34, 37, 38, 53, 56, 57, 58, 65, 97, 99, 108, 111, 115, 118, 123, 131, 137, 145, 147], 52",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 90 in the list [-94, -59, -5, 3, 11, 12, 21, 36, 38, 43, 75, 113, 120, 122].","[-94, -59, -5, 3, 11, 12, 21, 36, 38, 43, 75, 113, 120, 122], 90",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 21 in the array [-31, 4, 60, 98, 122, 135].","[-31, 4, 60, 98, 122, 135], 21",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -1 appear in [-93, -39, -20, 93, 114]? Use linear search to check.","[-93, -39, -20, 93, 114], -1",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -23 in the following list: [-55, -40, -3, 64, 90, 122, 130, 133, 135].","[-55, -40, -3, 64, 90, 122, 130, 133, 135], -23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 40 exists in [-99, -91, -88, -87, -78, -48, -47, -45, -33, -27, 21, 22, 25, 44, 45, 63, 81, 83, 91, 98, 99, 103, 109, 113, 124].","[-99, -91, -88, -87, -78, -48, -47, -45, -33, -27, 21, 22, 25, 44, 45, 63, 81, 83, 91, 98, 99, 103, 109, 113, 124], 40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -23 in the list [-92, -86, -83, -77, -63, 12, 35, 49, 53, 54, 55, 57, 69, 71, 72, 81, 91, 106, 126].","[-92, -86, -83, -77, -63, 12, 35, 49, 53, 54, 55, 57, 69, 71, 72, 81, 91, 106, 126], -23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -18 exists in [-100, -97, -94, -92, -88, -86, -75, -72, -68, -64, -62, -53, -50, -45, -44, -34, -30, -28, -24, -20, -9, -6, -3, 4, 9, 14, 19, 42, 48, 49, 53, 57, 63, 64, 70, 79, 80, 81, 93, 94, 106, 108, 110, 117, 121, 123, 140].","[-100, -97, -94, -92, -88, -86, -75, -72, -68, -64, -62, -53, -50, -45, -44, -34, -30, -28, -24, -20, -9, -6, -3, 4, 9, 14, 19, 42, 48, 49, 53, 57, 63, 64, 70, 79, 80, 81, 93, 94, 106, 108, 110, 117, 121, 123, 140], -18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 19 exists in [-73, -57, -11, 1, 11, 19, 20, 71, 87, 93, 100, 106, 111, 113, 118, 120, 127].","[-73, -57, -11, 1, 11, 19, 20, 71, 87, 93, 100, 106, 111, 113, 118, 120, 127], 19",Element found at index 5,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 65 appear in [-97, -95, -90, -89, -82, -75, -72, -60, -54, -42, -36, -34, -27, -24, -8, -3, 9, 17, 23, 35, 40, 41, 42, 43, 46, 50, 67, 73, 74, 77, 93, 94, 96, 97, 109, 112, 117, 129, 134, 137, 143]? Use linear search to check.","[-97, -95, -90, -89, -82, -75, -72, -60, -54, -42, -36, -34, -27, -24, -8, -3, 9, 17, 23, 35, 40, 41, 42, 43, 46, 50, 67, 73, 74, 77, 93, 94, 96, 97, 109, 112, 117, 129, 134, 137, 143], 65",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -30 in the array [-91, 19, 50, 87, 98, 144].","[-91, 19, 50, 87, 98, 144], -30",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -46 exists in [-49, -46, -41, -31, -24, -21, -18, -2, 1, 11, 12, 13, 24, 25, 28, 46, 51, 55, 61, 62, 69, 95, 97, 120, 128, 142, 146].","[-49, -46, -41, -31, -24, -21, -18, -2, 1, 11, 12, 13, 24, 25, 28, 46, 51, 55, 61, 62, 69, 95, 97, 120, 128, 142, 146], -46",Element found at index 1,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -10 in the array [-100, -93, -87, -86, -79, -68, -64, -49, -48, -44, -41, -40, -34, -28, -22, -21, -12, -9, -4, 9, 10, 18, 27, 28, 30, 48, 51, 52, 53, 57, 63, 66, 74, 84, 86, 87, 113, 117, 119, 123, 131, 132, 135, 141, 147].","[-100, -93, -87, -86, -79, -68, -64, -49, -48, -44, -41, -40, -34, -28, -22, -21, -12, -9, -4, 9, 10, 18, 27, 28, 30, 48, 51, 52, 53, 57, 63, 66, 74, 84, 86, 87, 113, 117, 119, 123, 131, 132, 135, 141, 147], -10",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -33 in the list [-71, -55, -47, -36, -23, -20, -7, 12, 15, 28, 33, 38, 58, 80, 87, 101, 122].","[-71, -55, -47, -36, -23, -20, -7, 12, 15, 28, 33, 38, 58, 80, 87, 101, 122], -33",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -46 in the array [-76, -75, -45, -43, 16, 50, 51, 97].","[-76, -75, -45, -43, 16, 50, 51, 97], -46",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -23 appear in [-97, -55, -42, -27, -24, -23, -19, -2, 11, 29, 33, 36, 39, 41, 42, 73, 74, 82, 88, 116, 126, 136, 137]? Use linear search to check.","[-97, -55, -42, -27, -24, -23, -19, -2, 11, 29, 33, 36, 39, 41, 42, 73, 74, 82, 88, 116, 126, 136, 137], -23",Element found at index 5,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 30 in the list [-98, -91, -86, -79, -72, -66, -50, -36, -17, -14, -11, -8, -6, -4, -2, 0, 3, 4, 12, 32, 37, 41, 42, 43, 55, 57, 65, 67, 71, 86, 94, 98, 102, 103, 110, 117, 121, 147].","[-98, -91, -86, -79, -72, -66, -50, -36, -17, -14, -11, -8, -6, -4, -2, 0, 3, 4, 12, 32, 37, 41, 42, 43, 55, 57, 65, 67, 71, 86, 94, 98, 102, 103, 110, 117, 121, 147], 30",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 4 in the following list: [-75, -32, 11, 22, 124, 136].","[-75, -32, 11, 22, 124, 136], 4",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 79 appear in [-98, -96, -91, -88, -78, -64, -61, -45, -31, -25, -4, 30, 32, 52, 59, 63, 68, 71, 76, 91, 114, 115, 119, 124, 128, 133, 134, 135]? Use linear search to check.","[-98, -96, -91, -88, -78, -64, -61, -45, -31, -25, -4, 30, 32, 52, 59, 63, 68, 71, 76, 91, 114, 115, 119, 124, 128, 133, 134, 135], 79",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 21 exists in [-97, -96, -86, -84, -79, -63, -62, -55, -47, -41, -30, -9, -8, -7, -1, 22, 51, 53, 55, 77, 80, 84, 87, 93, 96, 109, 129, 145, 146, 147].","[-97, -96, -86, -84, -79, -63, -62, -55, -47, -41, -30, -9, -8, -7, -1, 22, 51, 53, 55, 77, 80, 84, 87, 93, 96, 109, 129, 145, 146, 147], 21",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 18 in the list [-100, -79, -71, -63, -56, -55, -22, -21, -8, 31, 37, 55, 62, 65, 71, 74, 81, 106, 135, 141, 142].","[-100, -79, -71, -63, -56, -55, -22, -21, -8, 31, 37, 55, 62, 65, 71, 74, 81, 106, 135, 141, 142], 18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 87 in the array [-86, -79, -71, -68, -16, -8, 86, 88, 144].","[-86, -79, -71, -68, -16, -8, 86, 88, 144], 87",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -44 in the array [-95, -87, -85, -82, -80, -79, -55, -44, -37, -27, -25, -21, -8, -6, -5, 1, 10, 15, 17, 23, 47, 48, 64, 67, 73, 88, 124, 127, 140].","[-95, -87, -85, -82, -80, -79, -55, -44, -37, -27, -25, -21, -8, -6, -5, 1, 10, 15, 17, 23, 47, 48, 64, 67, 73, 88, 124, 127, 140], -44",Element found at index 7,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 21 appear in [-84, -71, -66, -40, 7, 15, 38, 52, 60, 63, 70, 76, 93, 94, 96, 100, 117, 121, 127]? Use linear search to check.","[-84, -71, -66, -40, 7, 15, 38, 52, 60, 63, 70, 76, 93, 94, 96, 100, 117, 121, 127], 21",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 69 appear in [-90, -84, -74, -51, -49, -41, -39, -27, -7, 0, 20, 26, 32, 45, 50, 63, 70, 71, 74, 97, 108]? Use linear search to check.","[-90, -84, -74, -51, -49, -41, -39, -27, -7, 0, 20, 26, 32, 45, 50, 63, 70, 71, 74, 97, 108], 69",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 49 in the array [-70, -68, -66, -59, -26, -25, -13, -2, -1, 9, 25, 54, 55, 56, 67, 103, 111, 123, 135, 143, 149].","[-70, -68, -66, -59, -26, -25, -13, -2, -1, 9, 25, 54, 55, 56, 67, 103, 111, 123, 135, 143, 149], 49",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 95 in the array [-90, -89, -80, -77, -75, -72, -67, -62, -55, -52, -46, -44, -35, -32, -25, -16, -14, 2, 8, 16, 19, 34, 46, 51, 55, 58, 59, 66, 67, 68, 79, 90, 91, 95, 106, 118, 121, 147].","[-90, -89, -80, -77, -75, -72, -67, -62, -55, -52, -46, -44, -35, -32, -25, -16, -14, 2, 8, 16, 19, 34, 46, 51, 55, 58, 59, 66, 67, 68, 79, 90, 91, 95, 106, 118, 121, 147], 95",Element found at index 33,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 48 exists in [-97, -80, -52, -29, 6, 20, 25, 110, 147].","[-97, -80, -52, -29, 6, 20, 25, 110, 147], 48",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 29 in the array [-73, -55, -31, -29, -17, -15, -6, -2, -1, 3, 5, 7, 18, 53, 54, 56, 65, 69, 71, 72, 75, 106, 113, 118, 119, 126, 137, 146, 147, 149].","[-73, -55, -31, -29, -17, -15, -6, -2, -1, 3, 5, 7, 18, 53, 54, 56, 65, 69, 71, 72, 75, 106, 113, 118, 119, 126, 137, 146, 147, 149], 29",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -14 in the following list: [-96, -91, -57, -42, -39, -38, -26, -8, 7, 13, 15, 21, 27, 28, 29, 46, 55, 58, 65, 77, 86, 95, 97, 100, 102, 103, 110, 112, 113, 115, 123, 126, 129, 140, 143, 144].","[-96, -91, -57, -42, -39, -38, -26, -8, 7, 13, 15, 21, 27, 28, 29, 46, 55, 58, 65, 77, 86, 95, 97, 100, 102, 103, 110, 112, 113, 115, 123, 126, 129, 140, 143, 144], -14",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -26 in the list [-100, -93, -88, -63, -44, -42, -35, -34, -32, -24, -22, 0, 9, 10, 23, 35, 53, 68, 69, 72, 80, 81, 90, 101, 110, 122, 125, 128, 132, 146, 148].","[-100, -93, -88, -63, -44, -42, -35, -34, -32, -24, -22, 0, 9, 10, 23, 35, 53, 68, 69, 72, 80, 81, 90, 101, 110, 122, 125, 128, 132, 146, 148], -26",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 28 in the following list: [-93, -92, -82, -80, -79, -60, -48, -36, -33, -29, -28, -15, -13, -3, -2, 12, 13, 16, 22, 26, 42, 53, 69, 73, 79, 82, 97, 104, 107, 130, 134, 137, 140, 147, 149].","[-93, -92, -82, -80, -79, -60, -48, -36, -33, -29, -28, -15, -13, -3, -2, 12, 13, 16, 22, 26, 42, 53, 69, 73, 79, 82, 97, 104, 107, 130, 134, 137, 140, 147, 149], 28",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -31 in the list [-93, -91, -87, -75, -70, -63, -56, -44, -40, -38, -37, -27, -25, -23, -18, -15, -7, 1, 22, 48, 53, 56, 64, 65, 66, 73, 75, 76, 85, 89, 94, 99, 100, 107, 111, 120, 121, 123, 126, 127, 135, 137, 144].","[-93, -91, -87, -75, -70, -63, -56, -44, -40, -38, -37, -27, -25, -23, -18, -15, -7, 1, 22, 48, 53, 56, 64, 65, 66, 73, 75, 76, 85, 89, 94, 99, 100, 107, 111, 120, 121, 123, 126, 127, 135, 137, 144], -31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 14 exists in [-87, -15, 44, 82, 87, 140].","[-87, -15, 44, 82, 87, 140], 14",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 58 appear in [-92, -76, -52, -45, -37, -36, -33, -18, -10, -6, -3, -1, 21, 25, 31, 46, 58, 69, 70, 72, 82, 110, 117, 133, 143]? Use linear search to check.","[-92, -76, -52, -45, -37, -36, -33, -18, -10, -6, -3, -1, 21, 25, 31, 46, 58, 69, 70, 72, 82, 110, 117, 133, 143], 58",Element found at index 16,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 70 in the following list: [-90, -69, -61, -56, -55, -52, -47, -46, -45, -39, -23, -19, -17, 0, 2, 4, 7, 11, 33, 38, 54, 64, 68, 69, 79, 83, 84, 87, 94, 99, 108, 112, 116, 117, 120, 128, 143, 146].","[-90, -69, -61, -56, -55, -52, -47, -46, -45, -39, -23, -19, -17, 0, 2, 4, 7, 11, 33, 38, 54, 64, 68, 69, 79, 83, 84, 87, 94, 99, 108, 112, 116, 117, 120, 128, 143, 146], 70",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 24 in the following list: [-88, -81, -76, -72, -67, -64, -62, -56, -53, -52, -33, -31, -30, -26, -24, -19, 3, 9, 19, 50, 51, 52, 65, 82, 85, 99, 103, 104, 108, 115, 117, 118, 127].","[-88, -81, -76, -72, -67, -64, -62, -56, -53, -52, -33, -31, -30, -26, -24, -19, 3, 9, 19, 50, 51, 52, 65, 82, 85, 99, 103, 104, 108, 115, 117, 118, 127], 24",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 32 appear in [-100, -93, -90, -72, -54, -51, -44, -43, -40, -36, -33, -30, -14, 12, 22, 28, 29, 49, 53, 61, 64, 68, 72, 85, 88, 101, 104, 110, 143]? Use linear search to check.","[-100, -93, -90, -72, -54, -51, -44, -43, -40, -36, -33, -30, -14, 12, 22, 28, 29, 49, 53, 61, 64, 68, 72, 85, 88, 101, 104, 110, 143], 32",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -8 appear in [-93, -92, -80, -70, -59, -54, -48, -46, -45, -44, -43, -42, -41, -36, -30, -28, -26, -20, -14, -10, -5, -3, -1, 2, 3, 4, 11, 14, 16, 23, 33, 42, 46, 55, 57, 59, 64, 83, 84, 96, 97, 99, 103, 104, 125, 131, 136, 139]? Use linear search to check.","[-93, -92, -80, -70, -59, -54, -48, -46, -45, -44, -43, -42, -41, -36, -30, -28, -26, -20, -14, -10, -5, -3, -1, 2, 3, 4, 11, 14, 16, 23, 33, 42, 46, 55, 57, 59, 64, 83, 84, 96, 97, 99, 103, 104, 125, 131, 136, 139], -8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -21 in the array [-95, -78, -66, -59, -56, -53, -49, -48, -44, -40, -23, -21, -16, -13, -11, -4, 5, 10, 12, 15, 20, 26, 30, 38, 44, 48, 52, 59, 61, 62, 64, 66, 70, 85, 89, 97, 107, 108, 120, 135, 138, 139, 141, 145, 147].","[-95, -78, -66, -59, -56, -53, -49, -48, -44, -40, -23, -21, -16, -13, -11, -4, 5, 10, 12, 15, 20, 26, 30, 38, 44, 48, 52, 59, 61, 62, 64, 66, 70, 85, 89, 97, 107, 108, 120, 135, 138, 139, 141, 145, 147], -21",Element found at index 11,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 30 in the list [-96, -90, -62, -50, -31, 18, 23, 41, 46, 82, 87, 125].","[-96, -90, -62, -50, -31, 18, 23, 41, 46, 82, 87, 125], 30",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 74 in the array [-96, -78, -76, -75, -71, -52, -48, -34, -30, -23, -20, -18, -15, -9, 15, 26, 30, 43, 47, 57, 59, 86, 87, 90, 108, 119].","[-96, -78, -76, -75, -71, -52, -48, -34, -30, -23, -20, -18, -15, -9, 15, 26, 30, 43, 47, 57, 59, 86, 87, 90, 108, 119], 74",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -15 in the list [-99, -90, -75, -74, -71, -60, -4, 7, 23, 28, 39, 53, 111, 112, 142].","[-99, -90, -75, -74, -71, -60, -4, 7, 23, 28, 39, 53, 111, 112, 142], -15",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -1 appear in [-96, -89, -88, -86, -84, -80, -78, -60, -54, -52, -47, -45, -41, -38, -25, -22, 22, 26, 30, 37, 39, 42, 44, 52, 84, 87, 90, 100, 125, 130, 133, 144, 145]? Use linear search to check.","[-96, -89, -88, -86, -84, -80, -78, -60, -54, -52, -47, -45, -41, -38, -25, -22, 22, 26, 30, 37, 39, 42, 44, 52, 84, 87, 90, 100, 125, 130, 133, 144, 145], -1",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 0 in the list [-99, -94, -88, -85, -83, -79, -78, -75, -68, -65, -54, -53, -46, -43, -32, -29, -26, -14, -10, -9, -5, -2, -1, 4, 10, 21, 30, 36, 37, 39, 43, 50, 53, 55, 61, 66, 75, 78, 83, 90, 100, 111, 113, 128, 133, 142, 144].","[-99, -94, -88, -85, -83, -79, -78, -75, -68, -65, -54, -53, -46, -43, -32, -29, -26, -14, -10, -9, -5, -2, -1, 4, 10, 21, 30, 36, 37, 39, 43, 50, 53, 55, 61, 66, 75, 78, 83, 90, 100, 111, 113, 128, 133, 142, 144], 0",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 91 in the list [-93, -87, -52, -45, -43, -25, -20, 8, 10, 15, 24, 47, 60, 74, 93, 115, 136, 138].","[-93, -87, -52, -45, -43, -25, -20, 8, 10, 15, 24, 47, 60, 74, 93, 115, 136, 138], 91",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -50 appear in [-93, -77, -62, -61, -55, -47, -45, -36, -33, -26, -17, -6, 1, 3, 8, 22, 47, 62, 70, 74, 84, 99, 103, 106, 113, 132, 144, 145, 146]? Use linear search to check.","[-93, -77, -62, -61, -55, -47, -45, -36, -33, -26, -17, -6, 1, 3, 8, 22, 47, 62, 70, 74, 84, 99, 103, 106, 113, 132, 144, 145, 146], -50",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 31 in the following list: [-85, -82, -60, -54, -52, -47, -45, -43, -42, -40, -28, -25, -17, -9, -5, -1, 1, 16, 43, 45, 66, 70, 72, 103, 106, 110, 133, 136, 144, 148, 149].","[-85, -82, -60, -54, -52, -47, -45, -43, -42, -40, -28, -25, -17, -9, -5, -1, 1, 16, 43, 45, 66, 70, 72, 103, 106, 110, 133, 136, 144, 148, 149], 31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -5 exists in [-71, -66, 19, 21, 50, 54, 69, 138].","[-71, -66, 19, 21, 50, 54, 69, 138], -5",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 85 in the following list: [-84, 10, 16, 113, 128].","[-84, 10, 16, 113, 128], 85",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -30 in the following list: [-100, -96, -84, -82, -66, -45, -34, 6, 12, 17, 35, 62, 66, 118, 121, 149].","[-100, -96, -84, -82, -66, -45, -34, 6, 12, 17, 35, 62, 66, 118, 121, 149], -30",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 22 exists in [-82, -59, -37, -18, -17, -5, 36, 41, 42, 58, 76, 81, 106].","[-82, -59, -37, -18, -17, -5, 36, 41, 42, 58, 76, 81, 106], 22",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 72 in the following list: [-97, -94, -73, -71, -69, -66, -63, -52, -48, -30, -25, -23, -22, -21, -20, -9, -6, -1, 0, 2, 16, 18, 21, 25, 32, 38, 42, 44, 68, 71, 72, 81, 86, 91, 95, 100, 105, 110, 121, 140, 144, 148].","[-97, -94, -73, -71, -69, -66, -63, -52, -48, -30, -25, -23, -22, -21, -20, -9, -6, -1, 0, 2, 16, 18, 21, 25, 32, 38, 42, 44, 68, 71, 72, 81, 86, 91, 95, 100, 105, 110, 121, 140, 144, 148], 72",Element found at index 30,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -41 in the following list: [-65, -56, -38, -36, -9, 64, 82, 96, 97].","[-65, -56, -38, -36, -9, 64, 82, 96, 97], -41",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 65 in the list [-88, -87, -43, -42, -41, -40, -37, -32, -21, -10, -7, 0, 5, 7, 24, 25, 51, 68, 86, 114, 132, 149].","[-88, -87, -43, -42, -41, -40, -37, -32, -21, -10, -7, 0, 5, 7, 24, 25, 51, 68, 86, 114, 132, 149], 65",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -14 appear in [-95, -92, -89, -49, -45, -43, -13, 4, 13, 18, 27, 51, 56, 117, 128]? Use linear search to check.","[-95, -92, -89, -49, -45, -43, -13, 4, 13, 18, 27, 51, 56, 117, 128], -14",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -7 in the array [-93, -91, -86, -76, -75, -49, -47, -36, -18, -7, -2, 2, 3, 7, 15, 16, 26, 31, 59, 73, 82, 86, 97, 100, 107, 127, 132, 142].","[-93, -91, -86, -76, -75, -49, -47, -36, -18, -7, -2, 2, 3, 7, 15, 16, 26, 31, 59, 73, 82, 86, 97, 100, 107, 127, 132, 142], -7",Element found at index 9,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 38 appear in [-100, -99, -89, -83, -61, -51, -37, -36, -17, -13, -9, -3, 8, 9, 10, 11, 12, 25, 28, 33, 57, 76, 99, 104, 127, 128, 142]? Use linear search to check.","[-100, -99, -89, -83, -61, -51, -37, -36, -17, -13, -9, -3, 8, 9, 10, 11, 12, 25, 28, 33, 57, 76, 99, 104, 127, 128, 142], 38",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 92 exists in [-91, -66, -63, -51, -40, -9, 0, 29, 37, 64, 71, 74, 91, 115, 128, 140].","[-91, -66, -63, -51, -40, -9, 0, 29, 37, 64, 71, 74, 91, 115, 128, 140], 92",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 73 in the following list: [-96, -87, -83, -75, -70, -62, -57, -52, -38, -33, -27, -26, -25, -23, -21, -20, -18, -17, 2, 4, 24, 26, 31, 52, 53, 59, 61, 63, 81, 122, 127, 137, 143].","[-96, -87, -83, -75, -70, -62, -57, -52, -38, -33, -27, -26, -25, -23, -21, -20, -18, -17, 2, 4, 24, 26, 31, 52, 53, 59, 61, 63, 81, 122, 127, 137, 143], 73",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 39 appear in [-96, -91, -83, -76, -64, -57, -53, -43, -36, -34, -20, -18, -3, 10, 34, 78, 124]? Use linear search to check.","[-96, -91, -83, -76, -64, -57, -53, -43, -36, -34, -20, -18, -3, 10, 34, 78, 124], 39",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 20 exists in [-85, -75, -64, -57, -55, -46, -41, -37, -36, -16, -9, -7, 14, 22, 25, 29, 33, 34, 40, 42, 73, 76, 80, 82, 83, 89, 122, 125, 138, 146].","[-85, -75, -64, -57, -55, -46, -41, -37, -36, -16, -9, -7, 14, 22, 25, 29, 33, 34, 40, 42, 73, 76, 80, 82, 83, 89, 122, 125, 138, 146], 20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 42 in the list [-87, -84, -82, -69, -63, -59, -54, -47, -45, -40, -29, -25, -7, -5, -4, 1, 2, 14, 38, 46, 52, 57, 65, 74, 79, 85, 86, 105, 108, 120, 122, 127, 129].","[-87, -84, -82, -69, -63, -59, -54, -47, -45, -40, -29, -25, -7, -5, -4, 1, 2, 14, 38, 46, 52, 57, 65, 74, 79, 85, 86, 105, 108, 120, 122, 127, 129], 42",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 75 appear in [-99, -98, -90, -85, -83, -76, -71, -66, -58, -56, -52, -47, -46, -42, -34, -33, -29, -24, -21, -9, -8, 6, 11, 13, 25, 34, 35, 39, 57, 61, 68, 91, 93, 103, 104, 112, 113, 148]? Use linear search to check.","[-99, -98, -90, -85, -83, -76, -71, -66, -58, -56, -52, -47, -46, -42, -34, -33, -29, -24, -21, -9, -8, 6, 11, 13, 25, 34, 35, 39, 57, 61, 68, 91, 93, 103, 104, 112, 113, 148], 75",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -47 appear in [-98, -93, -90, -88, -81, -80, -76, -69, -67, -66, -50, -46, -18, -3, -2, 1, 7, 20, 37, 38, 41, 44, 49, 53, 54, 57, 62, 63, 64, 66, 72, 76, 77, 83, 93, 97, 116, 123, 125, 128, 130, 138, 140]? Use linear search to check.","[-98, -93, -90, -88, -81, -80, -76, -69, -67, -66, -50, -46, -18, -3, -2, 1, 7, 20, 37, 38, 41, 44, 49, 53, 54, 57, 62, 63, 64, 66, 72, 76, 77, 83, 93, 97, 116, 123, 125, 128, 130, 138, 140], -47",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 63 appear in [-100, -94, -89, -74, -55, -50, -45, -37, -25, -24, -19, 1, 15, 21, 43, 46, 47, 89, 94, 103, 105, 109, 112, 119, 126, 133, 146]? Use linear search to check.","[-100, -94, -89, -74, -55, -50, -45, -37, -25, -24, -19, 1, 15, 21, 43, 46, 47, 89, 94, 103, 105, 109, 112, 119, 126, 133, 146], 63",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 55 in the array [-74, -70, -68, -62, -44, -36, -10, 22, 25, 34, 39, 70].","[-74, -70, -68, -62, -44, -36, -10, 22, 25, 34, 39, 70], 55",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -46 in the following list: [-97, -91, -86, -77, -73, -58, -57, -40, -36, -34, -32, -27, -24, -14, -12, -10, 0, 4, 14, 18, 22, 23, 29, 31, 32, 43, 56, 57, 63, 65, 68, 75, 77, 79, 81, 83, 101, 104, 106, 111, 122, 128, 134, 136, 137, 142, 144, 146].","[-97, -91, -86, -77, -73, -58, -57, -40, -36, -34, -32, -27, -24, -14, -12, -10, 0, 4, 14, 18, 22, 23, 29, 31, 32, 43, 56, 57, 63, 65, 68, 75, 77, 79, 81, 83, 101, 104, 106, 111, 122, 128, 134, 136, 137, 142, 144, 146], -46",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 51 in the array [-97, -51, -23, 0, 16, 19, 50, 57, 74, 76, 82, 101, 104, 143].","[-97, -51, -23, 0, 16, 19, 50, 57, 74, 76, 82, 101, 104, 143], 51",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -23 in the following list: [-99, -86, -83, -78, -73, -62, -50, -47, -34, -20, 12, 13, 21, 22, 26, 27, 29, 51, 55, 57, 58, 69, 77, 86, 101, 109, 115, 117, 125, 126, 135, 138, 145, 146, 149].","[-99, -86, -83, -78, -73, -62, -50, -47, -34, -20, 12, 13, 21, 22, 26, 27, 29, 51, 55, 57, 58, 69, 77, 86, 101, 109, 115, 117, 125, 126, 135, 138, 145, 146, 149], -23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 12 appear in [-96, -89, -82, -72, -7, 64, 69, 76, 101, 124, 139]? Use linear search to check.","[-96, -89, -82, -72, -7, 64, 69, 76, 101, 124, 139], 12",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 44 in the following list: [-84, -66, -61, -59, -53, -38, -32, 6, 15, 16, 20, 22, 36, 52, 61, 97, 98, 144, 149].","[-84, -66, -61, -59, -53, -38, -32, 6, 15, 16, 20, 22, 36, 52, 61, 97, 98, 144, 149], 44",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 5 in the following list: [-95, -94, -93, -85, -82, -78, -69, -40, -22, -20, -19, -12, -3, 2, 6, 14, 18, 20, 22, 24, 31, 35, 38, 40, 43, 48, 50, 53, 57, 65, 66, 67, 86, 92, 96, 97, 116, 122, 124, 139, 140, 142, 144, 148].","[-95, -94, -93, -85, -82, -78, -69, -40, -22, -20, -19, -12, -3, 2, 6, 14, 18, 20, 22, 24, 31, 35, 38, 40, 43, 48, 50, 53, 57, 65, 66, 67, 86, 92, 96, 97, 116, 122, 124, 139, 140, 142, 144, 148], 5",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 5 appear in [-100, -98, -72, -70, -62, -48, -8, 1, 8, 9, 10, 12, 13, 24, 27, 28, 30, 31, 39, 68, 83, 85, 86, 92, 94, 99, 110, 115, 116, 119, 147]? Use linear search to check.","[-100, -98, -72, -70, -62, -48, -8, 1, 8, 9, 10, 12, 13, 24, 27, 28, 30, 31, 39, 68, 83, 85, 86, 92, 94, 99, 110, 115, 116, 119, 147], 5",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 68 in the following list: [-62, -26, -15, 19, 75, 99].","[-62, -26, -15, 19, 75, 99], 68",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 55 in the list [-84, -76, -73, -59, -39, -23, 12, 23, 53, 64, 69, 83, 88, 89, 99, 107, 149].","[-84, -76, -73, -59, -39, -23, 12, 23, 53, 64, 69, 83, 88, 89, 99, 107, 149], 55",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -26 in the array [-92, -59, -54, -37, -27, -21, 27, 32, 41, 86, 106, 116, 120, 141].","[-92, -59, -54, -37, -27, -21, 27, 32, 41, 86, 106, 116, 120, 141], -26",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 76 exists in [-93, -84, -79, -74, -73, -66, -65, -61, -54, -53, -49, -44, -30, -24, -23, -17, -11, -8, 2, 6, 10, 16, 20, 29, 35, 39, 44, 45, 48, 61, 62, 67, 82, 85, 98, 100, 109, 112, 114, 115, 117, 118, 124, 129].","[-93, -84, -79, -74, -73, -66, -65, -61, -54, -53, -49, -44, -30, -24, -23, -17, -11, -8, 2, 6, 10, 16, 20, 29, 35, 39, 44, 45, 48, 61, 62, 67, 82, 85, 98, 100, 109, 112, 114, 115, 117, 118, 124, 129], 76",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -36 in the following list: [-85, -58, -53, -45, -34, -33, -32, -25, 35, 37, 51, 52, 71, 75, 78, 85, 94, 95, 112, 114, 124].","[-85, -58, -53, -45, -34, -33, -32, -25, 35, 37, 51, 52, 71, 75, 78, 85, 94, 95, 112, 114, 124], -36",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 10 exists in [-97, -92, -90, -86, -83, -81, -76, -72, -68, -67, -62, -53, -48, -45, -35, -28, -18, -2, 5, 7, 10, 34, 39, 42, 47, 51, 52, 63, 65, 67, 77, 78, 89, 94, 96, 109, 116, 119, 120, 132, 133, 142, 145, 146].","[-97, -92, -90, -86, -83, -81, -76, -72, -68, -67, -62, -53, -48, -45, -35, -28, -18, -2, 5, 7, 10, 34, 39, 42, 47, 51, 52, 63, 65, 67, 77, 78, 89, 94, 96, 109, 116, 119, 120, 132, 133, 142, 145, 146], 10",Element found at index 20,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -17 in the array [-99, -97, -92, -85, -83, -82, -77, -70, -63, -62, -59, -51, -43, -42, -32, -27, -26, -24, -12, 9, 18, 24, 32, 44, 45, 53, 62, 97, 108, 115, 137, 146].","[-99, -97, -92, -85, -83, -82, -77, -70, -63, -62, -59, -51, -43, -42, -32, -27, -26, -24, -12, 9, 18, 24, 32, 44, 45, 53, 62, 97, 108, 115, 137, 146], -17",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 79 in the array [-88, -82, -9, 23, 44, 65, 71, 91, 117].","[-88, -82, -9, 23, 44, 65, 71, 91, 117], 79",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 30 in the following list: [-86, -50, 2, 16, 20, 29, 39, 47, 51, 66, 78, 80, 142, 149].","[-86, -50, 2, 16, 20, 29, 39, 47, 51, 66, 78, 80, 142, 149], 30",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 96 in the array [-91, -70, -60, -42, -35, -31, -25, -9, 6, 73, 94, 111, 112, 123].","[-91, -70, -60, -42, -35, -31, -25, -9, 6, 73, 94, 111, 112, 123], 96",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 36 in the following list: [-94, -82, -77, -72, -68, -44, -39, -35, -26, -7, 4, 16, 35, 36, 50, 68, 92, 97, 100, 120, 123, 128, 135, 145, 148].","[-94, -82, -77, -72, -68, -44, -39, -35, -26, -7, 4, 16, 35, 36, 50, 68, 92, 97, 100, 120, 123, 128, 135, 145, 148], 36",Element found at index 13,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 13 exists in [-97, -89, -58, -50, -42, -9, -6, 20, 30, 49, 50, 53, 67, 89, 106, 125, 128, 139].","[-97, -89, -58, -50, -42, -9, -6, 20, 30, 49, 50, 53, 67, 89, 106, 125, 128, 139], 13",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 92 exists in [-92, -91, -82, -79, -68, -44, -33, -28, -3, 5, 26, 68, 76, 77, 83, 85, 90, 95, 103, 111, 130].","[-92, -91, -82, -79, -68, -44, -33, -28, -3, 5, 26, 68, 76, 77, 83, 85, 90, 95, 103, 111, 130], 92",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -35 in the list [-89, 23, 43, 87, 123].","[-89, 23, 43, 87, 123], -35",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -2 in the following list: [-94, -75, -69, -29, -19, -3, 0, 52, 84, 92, 145].","[-94, -75, -69, -29, -19, -3, 0, 52, 84, 92, 145], -2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 95 appear in [-80, -74, -62, -48, 82, 97]? Use linear search to check.","[-80, -74, -62, -48, 82, 97], 95",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -46 exists in [-100, -98, -93, -91, -83, -81, -68, -66, -64, -48, -47, -39, -36, -34, -31, -29, -26, -14, -4, 8, 16, 20, 24, 28, 31, 33, 44, 45, 48, 58, 59, 64, 67, 70, 71, 72, 76, 80, 102, 104, 116, 118, 120, 122, 123, 124, 133, 145, 146, 149].","[-100, -98, -93, -91, -83, -81, -68, -66, -64, -48, -47, -39, -36, -34, -31, -29, -26, -14, -4, 8, 16, 20, 24, 28, 31, 33, 44, 45, 48, 58, 59, 64, 67, 70, 71, 72, 76, 80, 102, 104, 116, 118, 120, 122, 123, 124, 133, 145, 146, 149], -46",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 84 exists in [-52, 10, 27, 45, 62, 148, 149].","[-52, 10, 27, 45, 62, 148, 149], 84",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 15 in the list [-96, -89, -74, -57, -25, -20, 15, 44, 85, 86, 116, 123, 146].","[-96, -89, -74, -57, -25, -20, 15, 44, 85, 86, 116, 123, 146], 15",Element found at index 6,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 19 in the list [-69, -55, -49, -44, -12, 12, 50, 59, 68, 75, 111, 114, 115, 127, 131].","[-69, -55, -49, -44, -12, 12, 50, 59, 68, 75, 111, 114, 115, 127, 131], 19",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 37 in the list [-96, -85, -69, -44, -4, 10, 52, 111, 124, 141].","[-96, -85, -69, -44, -4, 10, 52, 111, 124, 141], 37",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -8 in the list [-26, -13, 4, 15, 82, 86, 89, 100].","[-26, -13, 4, 15, 82, 86, 89, 100], -8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 77 in the array [-94, -78, -77, -53, -45, -44, -41, -39, -38, -26, -20, -15, 19, 28, 31, 34, 38, 43, 53, 64, 70, 75, 76, 80, 86, 90, 94, 101, 108, 109, 113, 120, 133, 136, 142, 147].","[-94, -78, -77, -53, -45, -44, -41, -39, -38, -26, -20, -15, 19, 28, 31, 34, 38, 43, 53, 64, 70, 75, 76, 80, 86, 90, 94, 101, 108, 109, 113, 120, 133, 136, 142, 147], 77",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -7 exists in [-96, -94, -91, -84, -82, -80, -76, -72, -68, -66, -53, -50, -41, -39, -32, -25, -18, 9, 14, 21, 31, 37, 55, 62, 68, 70, 72, 79, 82, 90, 93, 101, 108, 110, 120, 123, 128, 132, 135, 147].","[-96, -94, -91, -84, -82, -80, -76, -72, -68, -66, -53, -50, -41, -39, -32, -25, -18, 9, 14, 21, 31, 37, 55, 62, 68, 70, 72, 79, 82, 90, 93, 101, 108, 110, 120, 123, 128, 132, 135, 147], -7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 8 exists in [-90, -87, -74, -71, -60, -23, -18, -16, -13, -9, 0, 5, 9, 25, 39, 43, 66, 74, 79, 96, 109, 123, 127, 142, 146].","[-90, -87, -74, -71, -60, -23, -18, -16, -13, -9, 0, 5, 9, 25, 39, 43, 66, 74, 79, 96, 109, 123, 127, 142, 146], 8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 72 in the array [-92, -82, -81, -73, -71, -65, -62, -52, -50, -48, -41, -27, -20, -14, -10, 0, 27, 30, 31, 42, 60, 90, 98, 101, 120].","[-92, -82, -81, -73, -71, -65, -62, -52, -50, -48, -41, -27, -20, -14, -10, 0, 27, 30, 31, 42, 60, 90, 98, 101, 120], 72",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 37 in the list [-87, -79, -76, -74, -69, -67, -61, -60, -53, -48, -47, -44, -42, -32, -20, 7, 22, 27, 48, 55, 78, 81, 94, 109, 112, 123, 136].","[-87, -79, -76, -74, -69, -67, -61, -60, -53, -48, -47, -44, -42, -32, -20, 7, 22, 27, 48, 55, 78, 81, 94, 109, 112, 123, 136], 37",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 18 in the following list: [-87, -81, -76, -59, -51, -44, -32, -16, -10, -2, 9, 14, 37, 43, 46, 47, 55, 64, 67, 72, 82, 85, 92, 102, 104, 108, 114, 120, 137, 140, 142].","[-87, -81, -76, -59, -51, -44, -32, -16, -10, -2, 9, 14, 37, 43, 46, 47, 55, 64, 67, 72, 82, 85, 92, 102, 104, 108, 114, 120, 137, 140, 142], 18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -8 in the array [-92, -88, -73, -25, -9, 31, 44, 64, 73, 110].","[-92, -88, -73, -25, -9, 31, 44, 64, 73, 110], -8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 88 appear in [-97, -93, -85, -81, -80, -79, -77, -74, -50, -44, -39, -31, -26, -15, -10, -9, 7, 11, 25, 55, 56, 61, 64, 65, 71, 80, 81, 83, 84, 90, 92, 97, 100, 103, 104, 105, 111, 114, 127, 133, 136, 146]? Use linear search to check.","[-97, -93, -85, -81, -80, -79, -77, -74, -50, -44, -39, -31, -26, -15, -10, -9, 7, 11, 25, 55, 56, 61, 64, 65, 71, 80, 81, 83, 84, 90, 92, 97, 100, 103, 104, 105, 111, 114, 127, 133, 136, 146], 88",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -30 in the list [-98, -97, -89, -86, -85, -78, -71, -67, -65, -63, -62, -49, -47, -45, -37, -22, -17, -6, -5, -2, 2, 3, 5, 6, 7, 8, 12, 20, 21, 23, 29, 43, 46, 48, 56, 58, 60, 64, 67, 74, 77, 82, 121, 122, 124, 128, 130, 146].","[-98, -97, -89, -86, -85, -78, -71, -67, -65, -63, -62, -49, -47, -45, -37, -22, -17, -6, -5, -2, 2, 3, 5, 6, 7, 8, 12, 20, 21, 23, 29, 43, 46, 48, 56, 58, 60, 64, 67, 74, 77, 82, 121, 122, 124, 128, 130, 146], -30",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 76 in the array [-99, -67, -59, -58, -49, -40, -24, -7, 1, 35, 41, 65, 68, 89, 94, 95, 100, 102, 111, 121, 133].","[-99, -67, -59, -58, -49, -40, -24, -7, 1, 35, 41, 65, 68, 89, 94, 95, 100, 102, 111, 121, 133], 76",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 43 appear in [-56, -49, -11, 42, 144]? Use linear search to check.","[-56, -49, -11, 42, 144], 43",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 8 exists in [-100, -86, -72, -71, -67, -66, -61, -60, -58, -57, -53, -47, -38, -4, 5, 7, 11, 20, 28, 34, 53, 54, 60, 63, 67, 70, 74, 81, 123, 134, 136].","[-100, -86, -72, -71, -67, -66, -61, -60, -58, -57, -53, -47, -38, -4, 5, 7, 11, 20, 28, 34, 53, 54, 60, 63, 67, 70, 74, 81, 123, 134, 136], 8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 16 in the following list: [-88, -86, -76, -74, -65, -62, -55, -51, -47, -42, -16, -15, -13, 5, 13, 14, 18, 22, 33, 36, 37, 45, 46, 52, 56, 58, 78, 81, 86, 89, 90, 92, 94, 103, 110, 111, 117, 126, 128, 141, 143].","[-88, -86, -76, -74, -65, -62, -55, -51, -47, -42, -16, -15, -13, 5, 13, 14, 18, 22, 33, 36, 37, 45, 46, 52, 56, 58, 78, 81, 86, 89, 90, 92, 94, 103, 110, 111, 117, 126, 128, 141, 143], 16",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -48 appear in [-53, -38, -37, -10, 5, 6, 18, 23, 45, 59, 77, 88, 118, 140, 144]? Use linear search to check.","[-53, -38, -37, -10, 5, 6, 18, 23, 45, 59, 77, 88, 118, 140, 144], -48",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 72 in the list [-92, -70, -59, -21, -7, -3, 4, 13, 18, 44, 45, 76, 87, 92, 100, 105, 109].","[-92, -70, -59, -21, -7, -3, 4, 13, 18, 44, 45, 76, 87, 92, 100, 105, 109], 72",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 74 appear in [-79, -75, -72, -62, -59, -58, -54, -51, -49, -48, -41, -34, -32, -20, -13, -5, -1, 7, 11, 14, 60, 69, 76, 83, 94, 104, 108, 110, 111, 115, 121, 126, 132, 139, 149]? Use linear search to check.","[-79, -75, -72, -62, -59, -58, -54, -51, -49, -48, -41, -34, -32, -20, -13, -5, -1, 7, 11, 14, 60, 69, 76, 83, 94, 104, 108, 110, 111, 115, 121, 126, 132, 139, 149], 74",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -45 in the array [-96, -83, -76, -71, -64, -60, -51, -26, -24, -22, -20, -18, -16, -15, -5, -3, -1, 1, 2, 5, 7, 16, 20, 25, 29, 33, 35, 43, 50, 51, 53, 54, 62, 73, 81, 82, 84, 86, 95, 103, 115, 118, 122, 124, 125, 132, 141].","[-96, -83, -76, -71, -64, -60, -51, -26, -24, -22, -20, -18, -16, -15, -5, -3, -1, 1, 2, 5, 7, 16, 20, 25, 29, 33, 35, 43, 50, 51, 53, 54, 62, 73, 81, 82, 84, 86, 95, 103, 115, 118, 122, 124, 125, 132, 141], -45",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 40 in the following list: [-100, -94, -84, -82, -77, -70, -65, -55, -43, -35, -31, -30, -26, -20, -10, -7, -3, 0, 2, 12, 13, 19, 23, 29, 33, 34, 37, 50, 51, 57, 73, 76, 82, 84, 87, 91, 106, 108, 109, 119, 133, 134, 135, 142, 145, 149].","[-100, -94, -84, -82, -77, -70, -65, -55, -43, -35, -31, -30, -26, -20, -10, -7, -3, 0, 2, 12, 13, 19, 23, 29, 33, 34, 37, 50, 51, 57, 73, 76, 82, 84, 87, 91, 106, 108, 109, 119, 133, 134, 135, 142, 145, 149], 40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 22 in the array [-97, -71, -68, -60, -56, -46, -42, -31, 7, 29, 38, 59, 70, 97, 114, 120, 126, 138].","[-97, -71, -68, -60, -56, -46, -42, -31, 7, 29, 38, 59, 70, 97, 114, 120, 126, 138], 22",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 50 in the following list: [-99, -96, -95, -91, -90, -80, -73, -72, -54, -53, -48, -47, -44, -37, -35, -31, -21, -14, -11, -1, 1, 8, 11, 28, 29, 30, 31, 71, 76, 82, 83, 85, 89, 93, 99, 104, 106, 111, 120, 126, 146].","[-99, -96, -95, -91, -90, -80, -73, -72, -54, -53, -48, -47, -44, -37, -35, -31, -21, -14, -11, -1, 1, 8, 11, 28, 29, 30, 31, 71, 76, 82, 83, 85, 89, 93, 99, 104, 106, 111, 120, 126, 146], 50",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 93 exists in [-97, -83, -77, -74, -73, -66, -57, -46, -43, -15, -9, -6, 7, 14, 17, 43, 50, 61, 67, 73, 78, 82, 84, 87, 88, 94, 96, 107, 108, 114, 115, 121, 130, 138, 146, 147, 148].","[-97, -83, -77, -74, -73, -66, -57, -46, -43, -15, -9, -6, 7, 14, 17, 43, 50, 61, 67, 73, 78, 82, 84, 87, 88, 94, 96, 107, 108, 114, 115, 121, 130, 138, 146, 147, 148], 93",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -17 appear in [-98, -96, -93, -86, -82, -77, -75, -50, -48, -43, -36, -35, -27, -21, 7, 8, 10, 15, 25, 26, 32, 40, 42, 48, 51, 64, 67, 70, 97, 100, 118, 120, 128, 142]? Use linear search to check.","[-98, -96, -93, -86, -82, -77, -75, -50, -48, -43, -36, -35, -27, -21, 7, 8, 10, 15, 25, 26, 32, 40, 42, 48, 51, 64, 67, 70, 97, 100, 118, 120, 128, 142], -17",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -24 exists in [-87, -71, -63, -57, -54, -52, -47, -46, -45, -40, -39, -28, 22, 34, 48, 51, 54, 57, 62, 80, 87, 99, 112, 116, 128, 136, 139, 146].","[-87, -71, -63, -57, -54, -52, -47, -46, -45, -40, -39, -28, 22, 34, 48, 51, 54, 57, 62, 80, 87, 99, 112, 116, 128, 136, 139, 146], -24",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 22 exists in [-99, -85, -78, -59, -56, -54, -49, -36, -35, -34, -30, -26, -25, -21, -19, -14, -7, 1, 12, 13, 16, 20, 34, 40, 41, 47, 49, 57, 59, 62, 65, 67, 70, 79, 80, 82, 83, 90, 93, 95, 128, 131, 135].","[-99, -85, -78, -59, -56, -54, -49, -36, -35, -34, -30, -26, -25, -21, -19, -14, -7, 1, 12, 13, 16, 20, 34, 40, 41, 47, 49, 57, 59, 62, 65, 67, 70, 79, 80, 82, 83, 90, 93, 95, 128, 131, 135], 22",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 93 in the list [-100, -98, -92, -89, -88, -86, -75, -74, -71, -68, -62, -61, -55, -52, -51, -48, -42, -38, -33, -31, -25, -23, -19, -13, -9, -6, 10, 15, 18, 20, 29, 41, 49, 54, 61, 63, 64, 78, 90, 98, 99, 102, 105, 117, 119, 124, 141, 142].","[-100, -98, -92, -89, -88, -86, -75, -74, -71, -68, -62, -61, -55, -52, -51, -48, -42, -38, -33, -31, -25, -23, -19, -13, -9, -6, 10, 15, 18, 20, 29, 41, 49, 54, 61, 63, 64, 78, 90, 98, 99, 102, 105, 117, 119, 124, 141, 142], 93",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -33 in the list [-98, -86, -81, -80, -78, -63, -59, -53, -50, -37, -32, -25, -24, -14, -12, -10, -4, -3, 1, 9, 25, 30, 35, 37, 39, 41, 44, 49, 50, 52, 63, 70, 81, 89, 93, 99, 105, 122, 126, 134, 136, 149].","[-98, -86, -81, -80, -78, -63, -59, -53, -50, -37, -32, -25, -24, -14, -12, -10, -4, -3, 1, 9, 25, 30, 35, 37, 39, 41, 44, 49, 50, 52, 63, 70, 81, 89, 93, 99, 105, 122, 126, 134, 136, 149], -33",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 56 exists in [-82, -63, -37, -27, -26, -18, -9, -2, 23, 26, 31, 74, 77, 78, 82, 90, 95, 107, 114, 131, 132, 135, 143].","[-82, -63, -37, -27, -26, -18, -9, -2, 23, 26, 31, 74, 77, 78, 82, 90, 95, 107, 114, 131, 132, 135, 143], 56",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 95 in the following list: [-86, -84, -65, -42, -31, -22, -11, -4, 2, 11, 12, 20, 25, 46, 51, 63, 67, 70, 71, 74, 77, 79, 115, 131, 136, 138, 142].","[-86, -84, -65, -42, -31, -22, -11, -4, 2, 11, 12, 20, 25, 46, 51, 63, 67, 70, 71, 74, 77, 79, 115, 131, 136, 138, 142], 95",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -16 in the array [-95, -94, -87, -86, -77, -73, -63, -62, -59, -53, -48, -47, -36, -35, -26, -19, -18, -5, -2, 2, 10, 11, 16, 24, 27, 33, 48, 54, 58, 59, 66, 83, 85, 104, 105, 110, 112, 127, 133, 137, 148].","[-95, -94, -87, -86, -77, -73, -63, -62, -59, -53, -48, -47, -36, -35, -26, -19, -18, -5, -2, 2, 10, 11, 16, 24, 27, 33, 48, 54, 58, 59, 66, 83, 85, 104, 105, 110, 112, 127, 133, 137, 148], -16",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 9 exists in [-100, -99, -94, -89, -85, -84, -75, -72, -65, -58, -49, -43, -31, -9, -6, 4, 9, 11, 14, 33, 44, 66, 70, 75, 80, 82, 83, 103, 112, 117, 123, 128, 131, 144].","[-100, -99, -94, -89, -85, -84, -75, -72, -65, -58, -49, -43, -31, -9, -6, 4, 9, 11, 14, 33, 44, 66, 70, 75, 80, 82, 83, 103, 112, 117, 123, 128, 131, 144], 9",Element found at index 16,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -27 exists in [-93, -81, -56, -36, -19, -10, -9, 9, 23, 35, 38, 44, 60, 104, 111, 143].","[-93, -81, -56, -36, -19, -10, -9, 9, 23, 35, 38, 44, 60, 104, 111, 143], -27",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -9 in the array [-77, -36, -35, -10, -7, -4, 6, 17, 18, 21, 67, 68, 76, 89, 97, 125, 148].","[-77, -36, -35, -10, -7, -4, 6, 17, 18, 21, 67, 68, 76, 89, 97, 125, 148], -9",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 94 appear in [-98, -91, -89, -78, -77, -75, -72, -64, -60, -53, -43, -37, -32, -27, -20, -18, -13, 5, 14, 16, 22, 23, 26, 31, 33, 44, 45, 50, 52, 54, 61, 67, 68, 72, 87, 94, 98, 102, 104, 105, 108, 116, 118, 121, 124, 129, 135, 138, 146, 148]? Use linear search to check.","[-98, -91, -89, -78, -77, -75, -72, -64, -60, -53, -43, -37, -32, -27, -20, -18, -13, 5, 14, 16, 22, 23, 26, 31, 33, 44, 45, 50, 52, 54, 61, 67, 68, 72, 87, 94, 98, 102, 104, 105, 108, 116, 118, 121, 124, 129, 135, 138, 146, 148], 94",Element found at index 35,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 74 exists in [-100, -89, -15, 12, 47, 68, 85, 89, 95, 124].","[-100, -89, -15, 12, 47, 68, 85, 89, 95, 124], 74",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 87 in the following list: [-100, -88, -79, -62, -61, -53, -47, -40, -26, -22, 5, 57, 60, 61, 63, 64, 65, 67, 87, 91, 107, 125, 127].","[-100, -88, -79, -62, -61, -53, -47, -40, -26, -22, 5, 57, 60, 61, 63, 64, 65, 67, 87, 91, 107, 125, 127], 87",Element found at index 18,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 17 exists in [-100, -95, -93, -91, -90, -77, -76, -75, -66, -23, 22, 24, 35, 53, 54, 70, 85, 91, 101, 114, 116].","[-100, -95, -93, -91, -90, -77, -76, -75, -66, -23, 22, 24, 35, 53, 54, 70, 85, 91, 101, 114, 116], 17",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 75 appear in [-93, -83, -79, -78, -75, -73, -57, -47, -34, -8, 3, 13, 37, 47, 52, 76, 84, 85, 96, 130, 132, 144, 145, 146]? Use linear search to check.","[-93, -83, -79, -78, -75, -73, -57, -47, -34, -8, 3, 13, 37, 47, 52, 76, 84, 85, 96, 130, 132, 144, 145, 146], 75",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 55 in the following list: [-100, -68, -59, -55, -54, -45, -44, -43, -37, -33, -27, -22, -18, -17, 0, 14, 16, 18, 19, 20, 22, 24, 31, 34, 41, 52, 53, 62, 67, 70, 73, 94, 101, 106, 108, 109, 111, 112, 121, 126, 131, 132, 145, 147].","[-100, -68, -59, -55, -54, -45, -44, -43, -37, -33, -27, -22, -18, -17, 0, 14, 16, 18, 19, 20, 22, 24, 31, 34, 41, 52, 53, 62, 67, 70, 73, 94, 101, 106, 108, 109, 111, 112, 121, 126, 131, 132, 145, 147], 55",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 45 exists in [-67, -41, -25, 21, 27, 32, 73, 93].","[-67, -41, -25, 21, 27, 32, 73, 93], 45",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 14 exists in [-92, -85, -78, -77, -73, -71, -62, -49, -46, -31, -23, -18, -3, 8, 23, 24, 25, 28, 32, 46, 50, 57, 73, 75, 79, 81, 96, 100, 107, 121, 124, 127, 134].","[-92, -85, -78, -77, -73, -71, -62, -49, -46, -31, -23, -18, -3, 8, 23, 24, 25, 28, 32, 46, 50, 57, 73, 75, 79, 81, 96, 100, 107, 121, 124, 127, 134], 14",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 86 in the list [-95, -91, -83, -75, -62, -23, -21, -20, -7, 7, 26, 29, 65, 78, 86, 88, 90, 118, 124, 129].","[-95, -91, -83, -75, -62, -23, -21, -20, -7, 7, 26, 29, 65, 78, 86, 88, 90, 118, 124, 129], 86",Element found at index 14,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 50 appear in [-100, -80, -78, -34, -23, -19, -16, -13, -9, -3, -1, 2, 4, 14, 16, 21, 22, 30, 42, 45, 47, 51, 59, 62, 65, 73, 81, 84, 87, 99, 100, 108, 109, 117, 128, 131, 133, 134, 144]? Use linear search to check.","[-100, -80, -78, -34, -23, -19, -16, -13, -9, -3, -1, 2, 4, 14, 16, 21, 22, 30, 42, 45, 47, 51, 59, 62, 65, 73, 81, 84, 87, 99, 100, 108, 109, 117, 128, 131, 133, 134, 144], 50",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 61 exists in [-71, -58, -45, -39, -29, 4, 10, 32, 34, 62, 95, 108, 109, 114, 128, 135, 137].","[-71, -58, -45, -39, -29, 4, 10, 32, 34, 62, 95, 108, 109, 114, 128, 135, 137], 61",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 53 appear in [-93, -85, -83, -69, -68, -57, -47, -41, -35, -24, -23, -22, -17, -16, -13, -12, -10, 13, 18, 20, 30, 36, 45, 57, 60, 76, 82, 91, 94, 96, 97, 103, 111, 113, 130, 138, 146]? Use linear search to check.","[-93, -85, -83, -69, -68, -57, -47, -41, -35, -24, -23, -22, -17, -16, -13, -12, -10, 13, 18, 20, 30, 36, 45, 57, 60, 76, 82, 91, 94, 96, 97, 103, 111, 113, 130, 138, 146], 53",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -8 in the array [-83, -68, -50, -29, -28, -24, -2, -1, 1, 13, 22, 38, 39, 41, 52, 54, 55, 58, 62, 66, 82, 87, 91, 95, 106, 135, 146].","[-83, -68, -50, -29, -28, -24, -2, -1, 1, 13, 22, 38, 39, 41, 52, 54, 55, 58, 62, 66, 82, 87, 91, 95, 106, 135, 146], -8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -40 exists in [-95, -74, -68, -44, -6, -1, 5, 12, 18, 20, 43, 72, 83, 86, 93, 96, 104, 112, 122].","[-95, -74, -68, -44, -6, -1, 5, 12, 18, 20, 43, 72, 83, 86, 93, 96, 104, 112, 122], -40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 65 in the following list: [-76, -71, -66, -52, -48, -33, -30, -29, -20, 32, 41, 55, 91].","[-76, -71, -66, -52, -48, -33, -30, -29, -20, 32, 41, 55, 91], 65",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 80 exists in [-92, -88, -74, -73, -60, -48, -9, 2, 29, 42, 53, 65, 85, 96, 101, 106, 115, 127, 145, 147].","[-92, -88, -74, -73, -60, -48, -9, 2, 29, 42, 53, 65, 85, 96, 101, 106, 115, 127, 145, 147], 80",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 45 in the following list: [-99, -88, -84, -76, -66, -57, -56, -50, -43, -42, -38, -22, -17, -5, -4, 1, 2, 11, 13, 26, 27, 33, 39, 43, 48, 51, 57, 58, 66, 72, 73, 74, 77, 85, 93, 97, 108, 115, 120, 123, 129, 135, 144, 146, 147, 148].","[-99, -88, -84, -76, -66, -57, -56, -50, -43, -42, -38, -22, -17, -5, -4, 1, 2, 11, 13, 26, 27, 33, 39, 43, 48, 51, 57, 58, 66, 72, 73, 74, 77, 85, 93, 97, 108, 115, 120, 123, 129, 135, 144, 146, 147, 148], 45",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -11 in the array [-98, -97, -91, -88, -86, -80, -79, -78, -77, -64, -61, -59, -46, -31, -25, -22, -10, -9, -6, -1, 5, 6, 18, 26, 32, 35, 39, 53, 54, 55, 59, 77, 83, 90, 112, 147, 148].","[-98, -97, -91, -88, -86, -80, -79, -78, -77, -64, -61, -59, -46, -31, -25, -22, -10, -9, -6, -1, 5, 6, 18, 26, 32, 35, 39, 53, 54, 55, 59, 77, 83, 90, 112, 147, 148], -11",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -18 appear in [-78, -67, -59, -41, -34, -33, -4, 27, 29, 44, 64, 89, 105, 111, 114, 116, 129]? Use linear search to check.","[-78, -67, -59, -41, -34, -33, -4, 27, 29, 44, 64, 89, 105, 111, 114, 116, 129], -18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -47 in the following list: [-97, -82, -78, -72, -66, -63, -62, -54, -51, -46, -42, -35, -34, -18, -13, -10, 7, 20, 21, 26, 52, 63, 65, 70, 74, 94, 95, 99, 105, 110, 118, 128, 140].","[-97, -82, -78, -72, -66, -63, -62, -54, -51, -46, -42, -35, -34, -18, -13, -10, 7, 20, 21, 26, 52, 63, 65, 70, 74, 94, 95, 99, 105, 110, 118, 128, 140], -47",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 88 in the following list: [-97, -77, -76, -75, -67, -51, -45, -43, 16, 18, 22, 25, 65, 67, 68, 88, 94, 103, 112, 114, 116, 119].","[-97, -77, -76, -75, -67, -51, -45, -43, 16, 18, 22, 25, 65, 67, 68, 88, 94, 103, 112, 114, 116, 119], 88",Element found at index 15,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 58 in the array [-100, -99, -94, -89, -84, -80, -71, -70, -51, -47, -38, -35, -32, -24, -21, -6, -4, 8, 11, 12, 15, 19, 21, 22, 25, 42, 49, 58, 61, 63, 66, 73, 79, 81, 84, 85, 90, 101, 102, 103, 104, 117, 123, 127, 130, 134, 140, 143, 144].","[-100, -99, -94, -89, -84, -80, -71, -70, -51, -47, -38, -35, -32, -24, -21, -6, -4, 8, 11, 12, 15, 19, 21, 22, 25, 42, 49, 58, 61, 63, 66, 73, 79, 81, 84, 85, 90, 101, 102, 103, 104, 117, 123, 127, 130, 134, 140, 143, 144], 58",Element found at index 27,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 34 in the list [-77, -55, 14, 46, 63, 66, 104, 124, 144].","[-77, -55, 14, 46, 63, 66, 104, 124, 144], 34",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -11 in the array [-92, -88, -85, -75, -74, -66, -60, -57, -55, -54, -52, -51, -48, -47, -43, -36, -35, -33, -25, -19, -17, -10, -4, 2, 6, 9, 11, 12, 19, 22, 36, 39, 41, 47, 56, 69, 76, 83, 84, 88, 98, 100, 101, 108, 117, 119, 132, 136, 144].","[-92, -88, -85, -75, -74, -66, -60, -57, -55, -54, -52, -51, -48, -47, -43, -36, -35, -33, -25, -19, -17, -10, -4, 2, 6, 9, 11, 12, 19, 22, 36, 39, 41, 47, 56, 69, 76, 83, 84, 88, 98, 100, 101, 108, 117, 119, 132, 136, 144], -11",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 34 in the following list: [-94, -85, -77, -75, -66, -46, -30, -15, -5, -2, 2, 13, 29, 46, 50, 58, 81, 87, 94, 96, 99, 110, 126, 131, 137, 141].","[-94, -85, -77, -75, -66, -46, -30, -15, -5, -2, 2, 13, 29, 46, 50, 58, 81, 87, 94, 96, 99, 110, 126, 131, 137, 141], 34",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 30 exists in [-93, -85, -79, -74, -72, -64, -58, -54, -52, -48, -43, -41, -36, -8, 6, 11, 19, 28, 29, 31, 43, 52, 63, 69, 78, 80, 81, 102, 120, 127, 136].","[-93, -85, -79, -74, -72, -64, -58, -54, -52, -48, -43, -41, -36, -8, 6, 11, 19, 28, 29, 31, 43, 52, 63, 69, 78, 80, 81, 102, 120, 127, 136], 30",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 2 in the following list: [-98, -94, -38, -31, -11, 0, 2, 21, 24, 29, 41, 73, 80, 82, 83, 134].","[-98, -94, -38, -31, -11, 0, 2, 21, 24, 29, 41, 73, 80, 82, 83, 134], 2",Element found at index 6,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 31 appear in [-82, -58, -55, -48, 0, 2, 9, 23, 35, 36, 66, 69, 74, 116, 118, 120, 122, 136]? Use linear search to check.","[-82, -58, -55, -48, 0, 2, 9, 23, 35, 36, 66, 69, 74, 116, 118, 120, 122, 136], 31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 98 exists in [-100, -88, -72, -67, -60, -58, -46, -42, -31, -21, -17, -13, -10, -3, 4, 8, 11, 32, 36, 39, 41, 44, 45, 51, 56, 57, 69, 79, 81, 83, 93, 104, 113, 116, 124, 131, 136, 144].","[-100, -88, -72, -67, -60, -58, -46, -42, -31, -21, -17, -13, -10, -3, 4, 8, 11, 32, 36, 39, 41, 44, 45, 51, 56, 57, 69, 79, 81, 83, 93, 104, 113, 116, 124, 131, 136, 144], 98",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 83 in the list [-95, -83, -78, -77, -72, -71, -69, -61, -59, -50, -33, -28, -20, -16, -15, -11, -7, -1, 13, 14, 16, 23, 31, 37, 51, 56, 59, 62, 66, 67, 68, 70, 95, 99, 102, 114, 118, 126, 130, 135, 140, 148].","[-95, -83, -78, -77, -72, -71, -69, -61, -59, -50, -33, -28, -20, -16, -15, -11, -7, -1, 13, 14, 16, 23, 31, 37, 51, 56, 59, 62, 66, 67, 68, 70, 95, 99, 102, 114, 118, 126, 130, 135, 140, 148], 83",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 21 in the list [-99, -97, -91, -88, -85, -84, -83, -78, -75, -62, -50, -48, -42, -40, -27, -25, -24, -14, -6, -5, 1, 4, 23, 25, 37, 42, 46, 53, 61, 63, 75, 80, 86, 87, 117, 119, 120, 125, 127, 134, 140, 142].","[-99, -97, -91, -88, -85, -84, -83, -78, -75, -62, -50, -48, -42, -40, -27, -25, -24, -14, -6, -5, 1, 4, 23, 25, 37, 42, 46, 53, 61, 63, 75, 80, 86, 87, 117, 119, 120, 125, 127, 134, 140, 142], 21",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -9 in the following list: [-100, -95, -86, -85, -81, -80, -78, -77, -70, -69, -68, -67, -66, -58, -56, -54, -50, -48, -40, -35, -33, -31, -28, -16, -4, 0, 3, 10, 23, 33, 34, 48, 72, 74, 78, 81, 88, 93, 101, 113, 115, 122, 131, 137, 138, 140, 146, 148, 149].","[-100, -95, -86, -85, -81, -80, -78, -77, -70, -69, -68, -67, -66, -58, -56, -54, -50, -48, -40, -35, -33, -31, -28, -16, -4, 0, 3, 10, 23, 33, 34, 48, 72, 74, 78, 81, 88, 93, 101, 113, 115, 122, 131, 137, 138, 140, 146, 148, 149], -9",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -6 in the following list: [-93, -91, -85, -82, -77, -74, -71, -63, -60, -58, -50, -42, -40, -37, -31, -25, -20, -18, -15, -11, -10, -4, 0, 5, 19, 20, 23, 33, 40, 52, 69, 76, 77, 79, 88, 89, 99, 102, 110, 111, 120, 122, 130, 133, 134, 136, 140, 142].","[-93, -91, -85, -82, -77, -74, -71, -63, -60, -58, -50, -42, -40, -37, -31, -25, -20, -18, -15, -11, -10, -4, 0, 5, 19, 20, 23, 33, 40, 52, 69, 76, 77, 79, 88, 89, 99, 102, 110, 111, 120, 122, 130, 133, 134, 136, 140, 142], -6",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 90 appear in [-94, -90, -81, -56, -49, -43, -6, 0, 48, 56, 66, 89, 126, 136]? Use linear search to check.","[-94, -90, -81, -56, -49, -43, -6, 0, 48, 56, 66, 89, 126, 136], 90",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 94 appear in [-91, -88, -85, -84, -73, -69, -67, -37, -28, -21, -14, -10, 0, 3, 7, 10, 24, 31, 34, 40, 41, 44, 45, 49, 51, 55, 61, 65, 67, 68, 69, 70, 72, 81, 83, 87, 88, 90, 97, 100, 103, 109, 114, 117, 118, 123, 124, 128, 147]? Use linear search to check.","[-91, -88, -85, -84, -73, -69, -67, -37, -28, -21, -14, -10, 0, 3, 7, 10, 24, 31, 34, 40, 41, 44, 45, 49, 51, 55, 61, 65, 67, 68, 69, 70, 72, 81, 83, 87, 88, 90, 97, 100, 103, 109, 114, 117, 118, 123, 124, 128, 147], 94",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 89 in the following list: [-88, -87, -70, -52, -41, -37, -24, -8, -3, -1, 0, 13, 28, 30, 33, 50, 67, 86, 93, 112, 115, 123, 133, 134, 140, 149].","[-88, -87, -70, -52, -41, -37, -24, -8, -3, -1, 0, 13, 28, 30, 33, 50, 67, 86, 93, 112, 115, 123, 133, 134, 140, 149], 89",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 11 in the array [-97, -96, -93, -92, -87, -86, -84, -82, -79, -78, -76, -71, -70, -52, -38, -23, -20, -19, -8, -1, 11, 33, 42, 45, 46, 49, 53, 68, 77, 79, 82, 122, 129, 137, 142, 143].","[-97, -96, -93, -92, -87, -86, -84, -82, -79, -78, -76, -71, -70, -52, -38, -23, -20, -19, -8, -1, 11, 33, 42, 45, 46, 49, 53, 68, 77, 79, 82, 122, 129, 137, 142, 143], 11",Element found at index 20,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 19 exists in [-98, -81, -71, -38, -37, -36, -18, 11, 17, 52, 64, 74, 82, 92, 101, 120, 126, 129, 131].","[-98, -81, -71, -38, -37, -36, -18, 11, 17, 52, 64, 74, 82, 92, 101, 120, 126, 129, 131], 19",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 75 appear in [-99, -92, -83, -80, -77, -42, -30, -14, -11, 13, 18, 22, 34, 40, 47, 53, 54, 65, 88, 91, 97, 112, 113, 124, 146]? Use linear search to check.","[-99, -92, -83, -80, -77, -42, -30, -14, -11, 13, 18, 22, 34, 40, 47, 53, 54, 65, 88, 91, 97, 112, 113, 124, 146], 75",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 37 appear in [-80, -78, -56, -53, -50, -37, -33, -19, -14, -1, 9, 11, 34, 44, 55, 60, 62, 63, 72, 73, 74, 78, 84, 85, 98, 100, 116, 126, 128, 137]? Use linear search to check.","[-80, -78, -56, -53, -50, -37, -33, -19, -14, -1, 9, 11, 34, 44, 55, 60, 62, 63, 72, 73, 74, 78, 84, 85, 98, 100, 116, 126, 128, 137], 37",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 93 appear in [-96, -82, -81, -61, -47, -10, 3, 4, 9, 16, 26, 28, 41, 43, 56, 61, 65, 92, 99, 117, 125, 130, 133, 145, 147, 149]? Use linear search to check.","[-96, -82, -81, -61, -47, -10, 3, 4, 9, 16, 26, 28, 41, 43, 56, 61, 65, 92, 99, 117, 125, 130, 133, 145, 147, 149], 93",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 68 exists in [-82, -81, -72, -55, -47, -41, -39, -31, -22, -14, -1, 6, 13, 28, 30, 31, 43, 48, 63, 69, 71, 76, 89, 97, 125, 129, 133, 135, 142, 147].","[-82, -81, -72, -55, -47, -41, -39, -31, -22, -14, -1, 6, 13, 28, 30, 31, 43, 48, 63, 69, 71, 76, 89, 97, 125, 129, 133, 135, 142, 147], 68",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 20 appear in [-97, -93, -91, -87, -82, -78, -75, -70, -69, -52, -46, -44, -37, -22, 3, 5, 10, 23, 32, 40, 41, 55, 69, 79, 85, 87, 88, 96, 97, 101, 103, 106, 113, 115, 129, 133, 137]? Use linear search to check.","[-97, -93, -91, -87, -82, -78, -75, -70, -69, -52, -46, -44, -37, -22, 3, 5, 10, 23, 32, 40, 41, 55, 69, 79, 85, 87, 88, 96, 97, 101, 103, 106, 113, 115, 129, 133, 137], 20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -8 in the list [-96, -91, -72, -71, -69, -68, -62, -56, -54, -45, -43, -7, 3, 7, 8, 24, 59, 62, 67, 73, 82, 103, 130, 136, 140, 145].","[-96, -91, -72, -71, -69, -68, -62, -56, -54, -45, -43, -7, 3, 7, 8, 24, 59, 62, 67, 73, 82, 103, 130, 136, 140, 145], -8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 90 exists in [-95, -77, -47, -44, -29, -26, -25, -15, -12, -1, 1, 3, 12, 14, 16, 17, 20, 21, 24, 35, 43, 49, 50, 57, 70, 78, 89, 95, 101, 102, 125, 132, 145].","[-95, -77, -47, -44, -29, -26, -25, -15, -12, -1, 1, 3, 12, 14, 16, 17, 20, 21, 24, 35, 43, 49, 50, 57, 70, 78, 89, 95, 101, 102, 125, 132, 145], 90",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 72 in the array [-84, -82, -77, -75, -62, -52, -23, -10, 26, 51, 61, 79, 82, 97, 103, 105, 136, 147].","[-84, -82, -77, -75, -62, -52, -23, -10, 26, 51, 61, 79, 82, 97, 103, 105, 136, 147], 72",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 69 in the array [-97, -88, -85, -72, -69, -64, -57, -53, -38, -36, -35, 1, 18, 28, 46, 51, 70, 71, 73, 111, 126, 129, 131].","[-97, -88, -85, -72, -69, -64, -57, -53, -38, -36, -35, 1, 18, 28, 46, 51, 70, 71, 73, 111, 126, 129, 131], 69",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 88 in the list [-100, -97, -96, -94, -86, -82, -62, -56, -44, -42, -41, -40, -36, -30, -19, -18, -16, -15, -10, -4, -3, -1, 7, 11, 24, 29, 42, 48, 50, 55, 59, 75, 78, 86, 90, 93, 105, 107, 116, 124, 125, 127, 128, 129, 135, 137, 140, 143].","[-100, -97, -96, -94, -86, -82, -62, -56, -44, -42, -41, -40, -36, -30, -19, -18, -16, -15, -10, -4, -3, -1, 7, 11, 24, 29, 42, 48, 50, 55, 59, 75, 78, 86, 90, 93, 105, 107, 116, 124, 125, 127, 128, 129, 135, 137, 140, 143], 88",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -42 exists in [-97, -92, -85, -75, -72, -65, -56, -43, -40, -38, -37, -34, -27, -25, -14, -12, -4, 0, 1, 10, 14, 16, 20, 22, 30, 37, 39, 41, 49, 52, 53, 57, 61, 63, 66, 78, 95, 98, 104, 112, 113, 114].","[-97, -92, -85, -75, -72, -65, -56, -43, -40, -38, -37, -34, -27, -25, -14, -12, -4, 0, 1, 10, 14, 16, 20, 22, 30, 37, 39, 41, 49, 52, 53, 57, 61, 63, 66, 78, 95, 98, 104, 112, 113, 114], -42",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 56 appear in [-95, -88, -86, -71, -68, -65, -64, -58, -57, -56, -55, -51, -48, -47, -26, -12, -7, 5, 6, 17, 21, 24, 25, 29, 30, 38, 41, 43, 50, 63, 65, 67, 75, 76, 79, 83, 93, 99, 104, 107, 109, 111, 122, 131, 132, 133, 142]? Use linear search to check.","[-95, -88, -86, -71, -68, -65, -64, -58, -57, -56, -55, -51, -48, -47, -26, -12, -7, 5, 6, 17, 21, 24, 25, 29, 30, 38, 41, 43, 50, 63, 65, 67, 75, 76, 79, 83, 93, 99, 104, 107, 109, 111, 122, 131, 132, 133, 142], 56",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 56 appear in [-95, -87, -75, -71, -69, -66, -65, -57, -48, -46, -45, -43, -39, -21, -17, -10, 0, 1, 7, 14, 16, 22, 25, 61, 65, 67, 71, 74, 75, 80, 85, 86, 93, 99, 101, 103, 111, 116, 117, 118, 120, 127, 128, 129, 130, 140, 141, 148]? Use linear search to check.","[-95, -87, -75, -71, -69, -66, -65, -57, -48, -46, -45, -43, -39, -21, -17, -10, 0, 1, 7, 14, 16, 22, 25, 61, 65, 67, 71, 74, 75, 80, 85, 86, 93, 99, 101, 103, 111, 116, 117, 118, 120, 127, 128, 129, 130, 140, 141, 148], 56",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 10 in the array [-92, -89, -85, -80, -73, -65, -62, -56, -50, -49, -40, -30, -26, -24, -21, -15, -7, 20, 21, 22, 29, 36, 38, 64, 72, 79, 83, 85, 87, 90, 102, 103, 108, 134, 141, 143, 146].","[-92, -89, -85, -80, -73, -65, -62, -56, -50, -49, -40, -30, -26, -24, -21, -15, -7, 20, 21, 22, 29, 36, 38, 64, 72, 79, 83, 85, 87, 90, 102, 103, 108, 134, 141, 143, 146], 10",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 84 in the following list: [-98, -95, -88, -83, -82, -77, -74, -73, -62, -57, -52, -47, -41, -30, -27, -13, -9, -2, 7, 9, 12, 16, 23, 25, 28, 41, 50, 54, 55, 57, 58, 68, 71, 72, 74, 117, 131, 133, 140].","[-98, -95, -88, -83, -82, -77, -74, -73, -62, -57, -52, -47, -41, -30, -27, -13, -9, -2, 7, 9, 12, 16, 23, 25, 28, 41, 50, 54, 55, 57, 58, 68, 71, 72, 74, 117, 131, 133, 140], 84",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -22 in the list [-95, -86, -77, -65, -52, -50, -44, -36, -21, -20, -11, -6, -2, -1, 13, 15, 23, 24, 27, 30, 31, 36, 50, 61, 68, 71, 72, 75, 89, 99, 110, 112, 115, 124, 127, 128, 139, 149].","[-95, -86, -77, -65, -52, -50, -44, -36, -21, -20, -11, -6, -2, -1, 13, 15, 23, 24, 27, 30, 31, 36, 50, 61, 68, 71, 72, 75, 89, 99, 110, 112, 115, 124, 127, 128, 139, 149], -22",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 0 in the following list: [-91, -86, -81, -78, -75, -72, -41, -35, -29, -13, -12, -11, -4, -2, 9, 38, 39, 42, 46, 48, 62, 71, 93, 94, 114, 122, 126, 145, 146].","[-91, -86, -81, -78, -75, -72, -41, -35, -29, -13, -12, -11, -4, -2, 9, 38, 39, 42, 46, 48, 62, 71, 93, 94, 114, 122, 126, 145, 146], 0",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 56 exists in [-98, -96, -91, -82, -79, -63, -62, -53, -52, -42, -41, -32, -31, -19, -12, -8, -4, 3, 4, 14, 35, 41, 42, 49, 68, 78, 87, 88, 89, 102, 104, 134, 148].","[-98, -96, -91, -82, -79, -63, -62, -53, -52, -42, -41, -32, -31, -19, -12, -8, -4, 3, 4, 14, 35, 41, 42, 49, 68, 78, 87, 88, 89, 102, 104, 134, 148], 56",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 18 in the following list: [-86, -74, -27, -26, 8, 33, 85].","[-86, -74, -27, -26, 8, 33, 85], 18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 24 in the list [-47, -34, -31, 2, 54, 61, 80, 87, 100, 112, 115, 130, 131, 142].","[-47, -34, -31, 2, 54, 61, 80, 87, 100, 112, 115, 130, 131, 142], 24",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 10 in the array [-79, -74, -73, -59, -58, -47, -42, -27, -25, -24, -15, -3, -2, 4, 9, 11, 18, 19, 20, 21, 34, 64, 70, 73, 113, 132, 143].","[-79, -74, -73, -59, -58, -47, -42, -27, -25, -24, -15, -3, -2, 4, 9, 11, 18, 19, 20, 21, 34, 64, 70, 73, 113, 132, 143], 10",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 43 in the array [-99, -86, -75, -55, -52, -38, -15, -6, -2, 6, 12, 15, 19, 38, 53, 56, 57, 60, 67, 68, 80, 84, 86, 93, 94, 95, 96, 110, 112, 113, 122, 131, 144, 148].","[-99, -86, -75, -55, -52, -38, -15, -6, -2, 6, 12, 15, 19, 38, 53, 56, 57, 60, 67, 68, 80, 84, 86, 93, 94, 95, 96, 110, 112, 113, 122, 131, 144, 148], 43",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 24 exists in [-88, -45, -2, 32, 109, 133, 135].","[-88, -45, -2, 32, 109, 133, 135], 24",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 96 in the list [-94, -87, -70, -67, -35, -13, -3, 5, 10, 29, 31, 35, 49, 51, 55, 78, 86, 94, 122, 138].","[-94, -87, -70, -67, -35, -13, -3, 5, 10, 29, 31, 35, 49, 51, 55, 78, 86, 94, 122, 138], 96",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 6 in the following list: [-83, -70, -59, -56, -47, -34, -31, -19, -18, 11, 21, 27, 39, 41, 43, 46, 55, 58, 77, 94, 95, 105, 116, 129, 130, 131, 139, 145].","[-83, -70, -59, -56, -47, -34, -31, -19, -18, 11, 21, 27, 39, 41, 43, 46, 55, 58, 77, 94, 95, 105, 116, 129, 130, 131, 139, 145], 6",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 48 exists in [-93, -90, -88, -77, -68, -51, -37, -27, -18, -14, -1, 8, 12, 24, 50, 51, 67, 81, 86, 93, 106, 122, 137].","[-93, -90, -88, -77, -68, -51, -37, -27, -18, -14, -1, 8, 12, 24, 50, 51, 67, 81, 86, 93, 106, 122, 137], 48",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 41 in the array [-71, -37, 46, 61, 88, 104].","[-71, -37, 46, 61, 88, 104], 41",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 45 exists in [-82, -76, -57, 0, 62, 66, 67, 77, 80, 100, 133].","[-82, -76, -57, 0, 62, 66, 67, 77, 80, 100, 133], 45",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 10 in the array [-91, -89, -84, -81, -74, -51, -20, -14, -2, -1, 1, 4, 20, 21, 32, 52, 111, 125, 143].","[-91, -89, -84, -81, -74, -51, -20, -14, -2, -1, 1, 4, 20, 21, 32, 52, 111, 125, 143], 10",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 98 in the following list: [-98, -83, -81, -79, -78, -75, -72, -70, -67, -66, -58, -56, -55, -50, -40, -31, -29, -26, -20, -17, -8, -7, -1, 0, 1, 7, 30, 39, 42, 45, 46, 48, 65, 69, 70, 79, 89, 91, 94, 96, 101, 111, 131, 134, 142, 147].","[-98, -83, -81, -79, -78, -75, -72, -70, -67, -66, -58, -56, -55, -50, -40, -31, -29, -26, -20, -17, -8, -7, -1, 0, 1, 7, 30, 39, 42, 45, 46, 48, 65, 69, 70, 79, 89, 91, 94, 96, 101, 111, 131, 134, 142, 147], 98",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -47 in the array [-54, -30, 8, 17, 32, 83, 98, 104, 116, 119].","[-54, -30, 8, 17, 32, 83, 98, 104, 116, 119], -47",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 16 exists in [-87, -59, -47, -35, -22, -20, 2, 3, 17, 22, 28, 51, 67, 78, 118, 133, 135, 136, 143].","[-87, -59, -47, -35, -22, -20, 2, 3, 17, 22, 28, 51, 67, 78, 118, 133, 135, 136, 143], 16",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 72 in the following list: [-91, -64, 21, 33, 42, 55, 93, 97].","[-91, -64, 21, 33, 42, 55, 93, 97], 72",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 38 appear in [-99, -89, -72, -57, -55, -43, -25, -17, -16, -15, 21, 26, 54, 77, 80, 91, 96, 99, 100, 106, 109, 111, 134]? Use linear search to check.","[-99, -89, -72, -57, -55, -43, -25, -17, -16, -15, 21, 26, 54, 77, 80, 91, 96, 99, 100, 106, 109, 111, 134], 38",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 97 in the following list: [-69, -65, -57, -52, -28, -16, -9, -8, 14, 22, 30, 52, 54, 57, 61, 65, 67, 76, 83, 85, 91, 93, 95, 96, 98, 111, 113, 118, 124, 130, 135].","[-69, -65, -57, -52, -28, -16, -9, -8, 14, 22, 30, 52, 54, 57, 61, 65, 67, 76, 83, 85, 91, 93, 95, 96, 98, 111, 113, 118, 124, 130, 135], 97",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 94 exists in [-100, -95, -81, -80, -71, -69, -65, -63, -60, -57, -55, -52, -40, -36, -26, -23, -10, 7, 8, 16, 19, 36, 43, 55, 60, 67, 68, 73, 80, 84, 94, 113, 117, 132, 141, 144, 147].","[-100, -95, -81, -80, -71, -69, -65, -63, -60, -57, -55, -52, -40, -36, -26, -23, -10, 7, 8, 16, 19, 36, 43, 55, 60, 67, 68, 73, 80, 84, 94, 113, 117, 132, 141, 144, 147], 94",Element found at index 30,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 87 in the list [-91, -89, -88, -83, -72, -64, -61, -56, -50, -48, -41, -38, -32, -22, -19, -17, -5, 0, 5, 14, 19, 20, 29, 34, 40, 46, 57, 61, 63, 66, 68, 79, 83, 84, 92, 102, 105, 106, 110, 119, 120, 121, 132, 134, 141, 144].","[-91, -89, -88, -83, -72, -64, -61, -56, -50, -48, -41, -38, -32, -22, -19, -17, -5, 0, 5, 14, 19, 20, 29, 34, 40, 46, 57, 61, 63, 66, 68, 79, 83, 84, 92, 102, 105, 106, 110, 119, 120, 121, 132, 134, 141, 144], 87",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 29 exists in [-98, -94, -90, -71, -70, -56, -55, -48, -44, -41, -39, -13, -9, -1, 1, 9, 26, 29, 45, 56, 58, 70, 71, 84, 87, 91, 92, 95, 101, 108, 120, 127, 131, 138, 140, 142, 146].","[-98, -94, -90, -71, -70, -56, -55, -48, -44, -41, -39, -13, -9, -1, 1, 9, 26, 29, 45, 56, 58, 70, 71, 84, 87, 91, 92, 95, 101, 108, 120, 127, 131, 138, 140, 142, 146], 29",Element found at index 17,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 96 appear in [-82, -71, -67, -56, -31, 73, 85, 95, 124, 127, 131, 137, 147]? Use linear search to check.","[-82, -71, -67, -56, -31, 73, 85, 95, 124, 127, 131, 137, 147], 96",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -35 appear in [-94, -77, -73, -69, -56, -55, -52, -51, -49, -45, -44, -34, -32, -25, -23, -11, 9, 11, 16, 17, 19, 20, 24, 30, 35, 38, 39, 43, 50, 78, 82, 86, 89, 90, 91, 101, 103, 105, 125, 133, 139, 146]? Use linear search to check.","[-94, -77, -73, -69, -56, -55, -52, -51, -49, -45, -44, -34, -32, -25, -23, -11, 9, 11, 16, 17, 19, 20, 24, 30, 35, 38, 39, 43, 50, 78, 82, 86, 89, 90, 91, 101, 103, 105, 125, 133, 139, 146], -35",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -11 in the array [-95, -91, -90, -87, -84, -82, -72, -65, -63, -49, -37, -30, -28, -26, -25, -22, -4, 2, 4, 7, 13, 18, 21, 25, 26, 30, 32, 43, 44, 59, 72, 74, 78, 84, 86, 98, 109, 113, 116, 119, 129, 135, 137, 143, 146, 149].","[-95, -91, -90, -87, -84, -82, -72, -65, -63, -49, -37, -30, -28, -26, -25, -22, -4, 2, 4, 7, 13, 18, 21, 25, 26, 30, 32, 43, 44, 59, 72, 74, 78, 84, 86, 98, 109, 113, 116, 119, 129, 135, 137, 143, 146, 149], -11",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 27 appear in [-99, -77, -62, -55, -53, -51, -40, -20, -9, -2, 15, 24, 44, 45, 50, 95, 99, 110, 140]? Use linear search to check.","[-99, -77, -62, -55, -53, -51, -40, -20, -9, -2, 15, 24, 44, 45, 50, 95, 99, 110, 140], 27",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 23 exists in [-96, -86, -64, -33, -1, 48, 107].","[-96, -86, -64, -33, -1, 48, 107], 23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 96 exists in [-98, -93, -49, -46, -43, -11, -1, 1, 28, 36, 39, 40, 47, 48, 50, 51, 54, 61, 72, 74, 78, 86, 87, 98, 134, 141, 147].","[-98, -93, -49, -46, -43, -11, -1, 1, 28, 36, 39, 40, 47, 48, 50, 51, 54, 61, 72, 74, 78, 86, 87, 98, 134, 141, 147], 96",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -20 in the following list: [-98, -96, -92, -83, -82, -81, -78, -73, -50, -49, -25, -23, -18, -14, -6, 0, 3, 6, 10, 11, 14, 20, 22, 23, 35, 50, 57, 61, 67, 69, 70, 84, 88, 94, 106, 107, 115, 116, 117, 118, 119, 124, 126, 130, 142].","[-98, -96, -92, -83, -82, -81, -78, -73, -50, -49, -25, -23, -18, -14, -6, 0, 3, 6, 10, 11, 14, 20, 22, 23, 35, 50, 57, 61, 67, 69, 70, 84, 88, 94, 106, 107, 115, 116, 117, 118, 119, 124, 126, 130, 142], -20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 23 exists in [-98, -87, -69, -50, -42, -40, -38, -37, -31, -24, -18, -11, -6, -5, 12, 38, 39, 54, 60, 71, 73, 75, 77, 81, 86, 97, 103, 128, 143, 148].","[-98, -87, -69, -50, -42, -40, -38, -37, -31, -24, -18, -11, -6, -5, 12, 38, 39, 54, 60, 71, 73, 75, 77, 81, 86, 97, 103, 128, 143, 148], 23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -47 appear in [-90, -41, -39, -37, -18, -7, 18, 31, 55, 61, 86, 134, 141]? Use linear search to check.","[-90, -41, -39, -37, -18, -7, 18, 31, 55, 61, 86, 134, 141], -47",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -3 in the array [-90, -85, -81, -64, -62, -57, -55, -52, -46, -31, -19, -17, -14, -4, -2, 11, 39, 43, 53, 70, 75, 78, 89, 94, 104, 138, 139, 143, 145].","[-90, -85, -81, -64, -62, -57, -55, -52, -46, -31, -19, -17, -14, -4, -2, 11, 39, 43, 53, 70, 75, 78, 89, 94, 104, 138, 139, 143, 145], -3",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 26 in the following list: [-100, -93, -80, -78, -73, -71, -69, -67, -42, -39, -32, -28, -20, -19, -17, -15, -13, -9, -6, -3, -2, 7, 8, 15, 25, 30, 39, 41, 42, 48, 49, 50, 55, 57, 70, 89, 90, 101, 102, 107, 109, 118, 119, 120, 125, 131, 137, 141, 143, 147].","[-100, -93, -80, -78, -73, -71, -69, -67, -42, -39, -32, -28, -20, -19, -17, -15, -13, -9, -6, -3, -2, 7, 8, 15, 25, 30, 39, 41, 42, 48, 49, 50, 55, 57, 70, 89, 90, 101, 102, 107, 109, 118, 119, 120, 125, 131, 137, 141, 143, 147], 26",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 15 appear in [-96, -95, -83, -80, -78, -61, -59, -43, -42, -40, -33, -27, -26, -20, -10, 6, 9, 13, 17, 22, 27, 31, 41, 44, 61, 73, 82, 86, 88, 97, 101, 102, 111, 116, 126, 139, 143, 145, 149]? Use linear search to check.","[-96, -95, -83, -80, -78, -61, -59, -43, -42, -40, -33, -27, -26, -20, -10, 6, 9, 13, 17, 22, 27, 31, 41, 44, 61, 73, 82, 86, 88, 97, 101, 102, 111, 116, 126, 139, 143, 145, 149], 15",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 69 in the list [-99, -91, -77, -66, -61, -39, -37, -35, -21, -17, -16, 8, 24, 26, 33, 48, 56, 68, 91, 148].","[-99, -91, -77, -66, -61, -39, -37, -35, -21, -17, -16, 8, 24, 26, 33, 48, 56, 68, 91, 148], 69",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 89 exists in [-96, -93, -84, -82, -75, -71, -69, -30, -14, -11, -9, -5, 2, 8, 12, 45, 46, 51, 52, 55, 58, 69, 71, 78, 84, 97, 98, 129].","[-96, -93, -84, -82, -75, -71, -69, -30, -14, -11, -9, -5, 2, 8, 12, 45, 46, 51, 52, 55, 58, 69, 71, 78, 84, 97, 98, 129], 89",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 13 exists in [-82, -40, -36, -30, -24, -19, 5, 66, 107, 114, 124, 147].","[-82, -40, -36, -30, -24, -19, 5, 66, 107, 114, 124, 147], 13",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 46 in the array [-84, -63, -62, -57, -54, -33, -6, 4, 31, 40, 58, 69, 91, 144].","[-84, -63, -62, -57, -54, -33, -6, 4, 31, 40, 58, 69, 91, 144], 46",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 55 in the list [-90, -67, -60, -18, -6, 30, 33, 34, 60, 90, 125, 126, 135].","[-90, -67, -60, -18, -6, 30, 33, 34, 60, 90, 125, 126, 135], 55",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -21 in the list [-82, -73, -69, -68, -60, -47, -40, -37, -18, -10, -9, -6, -5, 22, 33, 35, 36, 41, 51, 53, 57, 58, 73, 80, 85, 87, 91, 96, 101, 108, 111, 127, 131, 135, 146, 147].","[-82, -73, -69, -68, -60, -47, -40, -37, -18, -10, -9, -6, -5, 22, 33, 35, 36, 41, 51, 53, 57, 58, 73, 80, 85, 87, 91, 96, 101, 108, 111, 127, 131, 135, 146, 147], -21",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 55 in the following list: [-97, -90, -89, -83, -81, -75, -73, -68, -61, -60, -57, -51, -46, -45, -44, -42, -34, -32, -28, -27, -13, -6, -3, 4, 16, 18, 23, 30, 41, 42, 51, 52, 65, 70, 81, 85, 88, 94, 104, 105, 111, 125, 128, 131, 133, 137, 139, 145, 147, 148].","[-97, -90, -89, -83, -81, -75, -73, -68, -61, -60, -57, -51, -46, -45, -44, -42, -34, -32, -28, -27, -13, -6, -3, 4, 16, 18, 23, 30, 41, 42, 51, 52, 65, 70, 81, 85, 88, 94, 104, 105, 111, 125, 128, 131, 133, 137, 139, 145, 147, 148], 55",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 29 in the array [-100, -85, -67, -64, -59, -58, -57, -51, -45, -43, -36, -30, -27, -22, -16, -15, -10, 0, 1, 7, 19, 25, 26, 32, 38, 39, 41, 44, 56, 63, 64, 65, 67, 68, 73, 77, 79, 89, 90, 95, 100, 116, 117, 122, 124, 129, 144, 146].","[-100, -85, -67, -64, -59, -58, -57, -51, -45, -43, -36, -30, -27, -22, -16, -15, -10, 0, 1, 7, 19, 25, 26, 32, 38, 39, 41, 44, 56, 63, 64, 65, 67, 68, 73, 77, 79, 89, 90, 95, 100, 116, 117, 122, 124, 129, 144, 146], 29",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -41 in the following list: [-82, -9, 5, 10, 34, 48].","[-82, -9, 5, 10, 34, 48], -41",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -31 in the list [-99, -90, -88, -85, -81, -80, -71, -60, -59, -49, -41, -37, -34, -32, -21, -15, -12, -3, 3, 5, 7, 22, 34, 40, 41, 50, 53, 57, 69, 70, 74, 78, 90, 92, 96, 99, 103, 107, 111, 122, 136, 146].","[-99, -90, -88, -85, -81, -80, -71, -60, -59, -49, -41, -37, -34, -32, -21, -15, -12, -3, 3, 5, 7, 22, 34, 40, 41, 50, 53, 57, 69, 70, 74, 78, 90, 92, 96, 99, 103, 107, 111, 122, 136, 146], -31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 15 appear in [-99, -90, -83, -81, -79, -75, -68, -56, -48, -42, -39, -24, -18, -17, -8, -7, -5, -2, -1, 14, 35, 36, 40, 42, 60, 124, 128, 129, 130, 131, 136, 148]? Use linear search to check.","[-99, -90, -83, -81, -79, -75, -68, -56, -48, -42, -39, -24, -18, -17, -8, -7, -5, -2, -1, 14, 35, 36, 40, 42, 60, 124, 128, 129, 130, 131, 136, 148], 15",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -40 appear in [-98, -95, -66, -52, -32, -22, -15, -13, -1, 22, 25, 34, 42, 55, 60, 63, 109, 130, 133, 147]? Use linear search to check.","[-98, -95, -66, -52, -32, -22, -15, -13, -1, 22, 25, 34, 42, 55, 60, 63, 109, 130, 133, 147], -40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 82 appear in [-96, -90, -84, -78, -73, -69, -46, -44, -37, -24, -19, -15, -8, 4, 11, 12, 13, 17, 21, 31, 38, 45, 47, 49, 50, 56, 64, 68, 69, 79, 88, 93, 94, 99, 102, 117, 120, 129, 135, 139, 144]? Use linear search to check.","[-96, -90, -84, -78, -73, -69, -46, -44, -37, -24, -19, -15, -8, 4, 11, 12, 13, 17, 21, 31, 38, 45, 47, 49, 50, 56, 64, 68, 69, 79, 88, 93, 94, 99, 102, 117, 120, 129, 135, 139, 144], 82",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 100 in the following list: [-83, -73, -54, -53, -37, -7, 25, 39, 45, 46, 51, 93, 95, 113, 129, 141].","[-83, -73, -54, -53, -37, -7, 25, 39, 45, 46, 51, 93, 95, 113, 129, 141], 100",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -31 in the following list: [-100, -99, -98, -93, -92, -89, -70, -63, -56, -55, -46, -43, -40, -38, -25, -14, -12, -5, 15, 25, 43, 48, 69, 71, 88, 94, 103, 108, 124, 134, 145, 146].","[-100, -99, -98, -93, -92, -89, -70, -63, -56, -55, -46, -43, -40, -38, -25, -14, -12, -5, 15, 25, 43, 48, 69, 71, 88, 94, 103, 108, 124, 134, 145, 146], -31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -31 in the following list: [-100, -95, -94, -77, -76, -74, -72, -70, -64, -58, -56, -51, -48, -43, -41, -40, -39, -36, -35, -28, -21, -16, -12, 1, 4, 5, 15, 28, 29, 36, 46, 55, 56, 60, 65, 69, 70, 81, 82, 83, 87, 88, 95, 97, 98, 105, 117, 125, 131, 140].","[-100, -95, -94, -77, -76, -74, -72, -70, -64, -58, -56, -51, -48, -43, -41, -40, -39, -36, -35, -28, -21, -16, -12, 1, 4, 5, 15, 28, 29, 36, 46, 55, 56, 60, 65, 69, 70, 81, 82, 83, 87, 88, 95, 97, 98, 105, 117, 125, 131, 140], -31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -30 in the list [-99, -96, -71, -63, -38, -26, -13, -10, 3, 21, 22, 43, 49, 57, 95, 100, 105, 111, 128].","[-99, -96, -71, -63, -38, -26, -13, -10, 3, 21, 22, 43, 49, 57, 95, 100, 105, 111, 128], -30",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -33 appear in [-96, -77, -76, -70, -49, -41, -35, -28, -22, -20, -18, -5, -4, -2, 6, 7, 20, 28, 45, 57, 58, 60, 67, 71, 78, 108, 122, 123]? Use linear search to check.","[-96, -77, -76, -70, -49, -41, -35, -28, -22, -20, -18, -5, -4, -2, 6, 7, 20, 28, 45, 57, 58, 60, 67, 71, 78, 108, 122, 123], -33",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 43 appear in [-97, -86, -80, -78, -75, -69, -68, -65, -61, -54, -53, -51, -36, -32, -24, -22, -15, -11, -10, 2, 4, 6, 18, 36, 41, 49, 52, 60, 64, 69, 70, 72, 76, 84, 85, 88, 91, 94, 105, 106, 118, 127, 148]? Use linear search to check.","[-97, -86, -80, -78, -75, -69, -68, -65, -61, -54, -53, -51, -36, -32, -24, -22, -15, -11, -10, 2, 4, 6, 18, 36, 41, 49, 52, 60, 64, 69, 70, 72, 76, 84, 85, 88, 91, 94, 105, 106, 118, 127, 148], 43",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 74 in the following list: [-90, -59, -58, -57, -55, -44, -43, -33, -29, -24, -22, -8, 5, 9, 16, 44, 46, 47, 76, 78, 79, 82, 84, 93, 94, 107, 116, 127, 130].","[-90, -59, -58, -57, -55, -44, -43, -33, -29, -24, -22, -8, 5, 9, 16, 44, 46, 47, 76, 78, 79, 82, 84, 93, 94, 107, 116, 127, 130], 74",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 31 appear in [-90, -89, -75, -70, -67, -54, -52, -47, -32, -26, -15, -12, 0, 3, 14, 21, 22, 23, 27, 35, 36, 59, 65, 74, 96, 99, 103, 105, 112, 117, 124, 126, 134, 146, 147]? Use linear search to check.","[-90, -89, -75, -70, -67, -54, -52, -47, -32, -26, -15, -12, 0, 3, 14, 21, 22, 23, 27, 35, 36, 59, 65, 74, 96, 99, 103, 105, 112, 117, 124, 126, 134, 146, 147], 31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -31 exists in [-100, -96, -95, -84, -81, -80, -76, -74, -63, -52, -51, -45, -29, -25, -22, -19, 9, 16, 18, 19, 21, 45, 48, 52, 54, 57, 63, 64, 66, 72, 76, 81, 89, 90, 98, 100, 107, 127, 129, 133, 140, 141].","[-100, -96, -95, -84, -81, -80, -76, -74, -63, -52, -51, -45, -29, -25, -22, -19, 9, 16, 18, 19, 21, 45, 48, 52, 54, 57, 63, 64, 66, 72, 76, 81, 89, 90, 98, 100, 107, 127, 129, 133, 140, 141], -31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 74 in the array [-100, -99, -96, -93, -85, -82, -75, -69, -67, -60, -57, -52, -50, -46, -2, 32, 45, 47, 64, 69, 70, 72, 74, 75, 87, 92, 97, 103, 107, 123, 126, 136, 138, 147, 149].","[-100, -99, -96, -93, -85, -82, -75, -69, -67, -60, -57, -52, -50, -46, -2, 32, 45, 47, 64, 69, 70, 72, 74, 75, 87, 92, 97, 103, 107, 123, 126, 136, 138, 147, 149], 74",Element found at index 22,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 77 in the array [-98, -88, -80, -66, -61, -42, -41, -35, -29, -19, -2, 2, 13, 40, 96, 108].","[-98, -88, -80, -66, -61, -42, -41, -35, -29, -19, -2, 2, 13, 40, 96, 108], 77",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Easy Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 98 in the array [-98, -92, -85, -73, -71, -66, -65, -56, -55, -52, -47, -46, -45, -39, -30, -16, -14, -12, -9, -6, -4, 4, 41, 46, 49, 50, 54, 58, 60, 67, 69, 77, 80, 83, 85, 87, 96, 97, 103, 109, 119, 132, 133, 146].","[-98, -92, -85, -73, -71, -66, -65, -56, -55, -52, -47, -46, -45, -39, -30, -16, -14, -12, -9, -6, -4, 4, 41, 46, 49, 50, 54, 58, 60, 67, 69, 77, 80, 83, 85, 87, 96, 97, 103, 109, 119, 132, 133, 146], 98",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -24 in the list [-85, -56, -43, -38, 46, 66, 77, 88, 111, 132].","[-85, -56, -43, -38, 46, 66, 77, 88, 111, 132], -24",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 87 in the following list: [-84, -82, -74, -69, -59, -58, -56, -51, -44, -42, -34, -31, 3, 4, 6, 7, 27, 38, 65, 77, 83, 86, 91, 120, 122, 123, 142, 149].","[-84, -82, -74, -69, -59, -58, -56, -51, -44, -42, -34, -31, 3, 4, 6, 7, 27, 38, 65, 77, 83, 86, 91, 120, 122, 123, 142, 149], 87",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 49 exists in [-100, -95, -91, -88, -42, -25, -16, 7, 15, 29, 36, 45, 49, 57, 81, 86, 96, 102, 124, 142].","[-100, -95, -91, -88, -42, -25, -16, 7, 15, 29, 36, 45, 49, 57, 81, 86, 96, 102, 124, 142], 49",Element found at index 12,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 46 in the following list: [-97, -85, -84, -82, -79, -75, -71, -55, -44, -40, -39, -34, -24, -21, -14, -10, -8, -7, -3, -1, 9, 12, 13, 15, 17, 28, 34, 39, 45, 48, 59, 63, 69, 74, 80, 86, 88, 92, 103, 105, 115, 120, 126, 133, 136, 142, 145].","[-97, -85, -84, -82, -79, -75, -71, -55, -44, -40, -39, -34, -24, -21, -14, -10, -8, -7, -3, -1, 9, 12, 13, 15, 17, 28, 34, 39, 45, 48, 59, 63, 69, 74, 80, 86, 88, 92, 103, 105, 115, 120, 126, 133, 136, 142, 145], 46",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 74 exists in [-80, -76, -64, -62, -51, -25, -14, 15, 16, 23, 37, 43, 48, 64, 74, 88, 109, 120, 130].","[-80, -76, -64, -62, -51, -25, -14, 15, 16, 23, 37, 43, 48, 64, 74, 88, 109, 120, 130], 74",Element found at index 14,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -5 in the list [-99, -96, -95, -90, -83, -60, -55, -52, -50, -45, -36, -30, -25, -18, -15, -10, -7, -1, 0, 2, 12, 14, 16, 19, 21, 25, 29, 30, 32, 55, 61, 71, 75, 78, 79, 103, 108, 113, 115, 119, 120, 127, 128, 131, 138, 142, 144].","[-99, -96, -95, -90, -83, -60, -55, -52, -50, -45, -36, -30, -25, -18, -15, -10, -7, -1, 0, 2, 12, 14, 16, 19, 21, 25, 29, 30, 32, 55, 61, 71, 75, 78, 79, 103, 108, 113, 115, 119, 120, 127, 128, 131, 138, 142, 144], -5",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 59 in the following list: [-71, -16, 0, 5, 6, 24, 79, 100, 106, 130].","[-71, -16, 0, 5, 6, 24, 79, 100, 106, 130], 59",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 64 in the array [-91, -85, -73, -70, -60, -24, -23, 3, 10, 16, 37, 52, 102, 105, 106, 133].","[-91, -85, -73, -70, -60, -24, -23, 3, 10, 16, 37, 52, 102, 105, 106, 133], 64",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 2 in the following list: [58, 84, 101, 102, 130, 142].","[58, 84, 101, 102, 130, 142], 2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -22 in the following list: [-98, -73, -64, -60, -42, -34, -28, -27, -26, -23, -17, -10, 10, 17, 20, 29, 38, 51, 63, 71, 72, 86, 93, 99, 113, 135, 139, 148].","[-98, -73, -64, -60, -42, -34, -28, -27, -26, -23, -17, -10, 10, 17, 20, 29, 38, 51, 63, 71, 72, 86, 93, 99, 113, 135, 139, 148], -22",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 51 appear in [-86, -80, -70, -67, -28, -9, -1, 19, 22, 46, 49, 71, 94, 103, 114, 115, 133, 139, 143]? Use linear search to check.","[-86, -80, -70, -67, -28, -9, -1, 19, 22, 46, 49, 71, 94, 103, 114, 115, 133, 139, 143], 51",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -40 in the array [-35, -18, 9, 17, 30, 32, 38, 41, 60, 80, 94, 100, 126, 128, 137].","[-35, -18, 9, 17, 30, 32, 38, 41, 60, 80, 94, 100, 126, 128, 137], -40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 16 in the list [-84, -82, -80, -65, -57, -56, -52, -48, -41, -27, -1, 6, 8, 19, 120, 121, 139, 147].","[-84, -82, -80, -65, -57, -56, -52, -48, -41, -27, -1, 6, 8, 19, 120, 121, 139, 147], 16",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 28 in the following list: [-99, -92, -86, -84, -81, -76, -73, -72, -67, -64, -61, -53, -51, -50, -43, -40, -36, -22, -21, -16, -4, 1, 4, 5, 12, 14, 19, 27, 43, 45, 51, 58, 69, 80, 94, 102, 122, 125, 127, 134].","[-99, -92, -86, -84, -81, -76, -73, -72, -67, -64, -61, -53, -51, -50, -43, -40, -36, -22, -21, -16, -4, 1, 4, 5, 12, 14, 19, 27, 43, 45, 51, 58, 69, 80, 94, 102, 122, 125, 127, 134], 28",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 55 exists in [-100, -99, -98, -93, -80, -76, -70, -62, -61, -58, -50, -48, -10, -4, -3, 0, 8, 10, 19, 36, 39, 40, 41, 44, 59, 60, 68, 71, 72, 76, 77, 80, 94, 96, 98, 100, 117, 118, 124, 126, 130, 132, 137, 145].","[-100, -99, -98, -93, -80, -76, -70, -62, -61, -58, -50, -48, -10, -4, -3, 0, 8, 10, 19, 36, 39, 40, 41, 44, 59, 60, 68, 71, 72, 76, 77, 80, 94, 96, 98, 100, 117, 118, 124, 126, 130, 132, 137, 145], 55",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 59 in the following list: [-33, -20, 21, 49, 56, 72, 78, 96, 102, 111, 118].","[-33, -20, 21, 49, 56, 72, 78, 96, 102, 111, 118], 59",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 83 exists in [-96, -81, -71, 6, 13, 15, 44, 59, 113, 116].","[-96, -81, -71, 6, 13, 15, 44, 59, 113, 116], 83",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 6 exists in [-96, -83, -81, -62, -45, -15, 10, 14, 49, 66, 88, 109, 112].","[-96, -83, -81, -62, -45, -15, 10, 14, 49, 66, 88, 109, 112], 6",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 38 in the following list: [-99, -97, -95, -94, -85, -77, -43, 29, 35, 64, 66, 78, 111, 118].","[-99, -97, -95, -94, -85, -77, -43, 29, 35, 64, 66, 78, 111, 118], 38",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -26 in the list [-70, -49, -40, -11, 17, 19, 22, 30, 37, 45, 56, 60, 62, 80, 97, 137].","[-70, -49, -40, -11, 17, 19, 22, 30, 37, 45, 56, 60, 62, 80, 97, 137], -26",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 28 appear in [-99, -88, -72, -68, -55, -50, -43, -34, -9, -3, 0, 6, 7, 14, 23, 29, 41, 45, 52, 65, 70, 83, 84, 86, 95, 96, 101, 107, 111, 120, 124, 128, 131, 140]? Use linear search to check.","[-99, -88, -72, -68, -55, -50, -43, -34, -9, -3, 0, 6, 7, 14, 23, 29, 41, 45, 52, 65, 70, 83, 84, 86, 95, 96, 101, 107, 111, 120, 124, 128, 131, 140], 28",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -10 exists in [-84, -63, -51, -47, -39, -27, 6, 26, 35, 36, 38, 48, 59, 98, 99, 101, 102, 116, 138, 141].","[-84, -63, -51, -47, -39, -27, 6, 26, 35, 36, 38, 48, 59, 98, 99, 101, 102, 116, 138, 141], -10",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -43 appear in [-66, -47, -43, -26, -22, 3, 5, 28, 34, 39, 41, 43, 50, 51, 80, 90, 119, 128, 135, 142]? Use linear search to check.","[-66, -47, -43, -26, -22, 3, 5, 28, 34, 39, 41, 43, 50, 51, 80, 90, 119, 128, 135, 142], -43",Element found at index 2,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -9 appear in [-95, -91, -62, -56, -35, -21, -8, 3, 20, 26, 42, 44, 46, 49, 52, 61, 66, 68, 82, 104, 108]? Use linear search to check.","[-95, -91, -62, -56, -35, -21, -8, 3, 20, 26, 42, 44, 46, 49, 52, 61, 66, 68, 82, 104, 108], -9",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -43 in the following list: [-66, -20, -2, 47, 74, 78, 91, 100].","[-66, -20, -2, 47, 74, 78, 91, 100], -43",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -33 exists in [-97, -86, -83, -77, -73, -72, -71, -64, -60, -50, -45, -43, -39, -36, -35, -28, -22, -11, -9, 13, 14, 30, 38, 43, 48, 53, 54, 55, 79, 81, 82, 84, 92, 98, 105, 108, 121, 123, 137, 139, 141].","[-97, -86, -83, -77, -73, -72, -71, -64, -60, -50, -45, -43, -39, -36, -35, -28, -22, -11, -9, 13, 14, 30, 38, 43, 48, 53, 54, 55, 79, 81, 82, 84, 92, 98, 105, 108, 121, 123, 137, 139, 141], -33",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 100 in the list [-99, -96, -83, -78, -75, -61, -45, -43, -39, -34, -24, -16, -15, 6, 27, 28, 29, 67, 73, 74, 85, 116, 117, 124, 134].","[-99, -96, -83, -78, -75, -61, -45, -43, -39, -34, -24, -16, -15, 6, 27, 28, 29, 67, 73, 74, 85, 116, 117, 124, 134], 100",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 21 in the list [-82, -62, -41, -28, -22, 0, 4, 11, 52, 64, 70, 71, 85, 120, 123, 130].","[-82, -62, -41, -28, -22, 0, 4, 11, 52, 64, 70, 71, 85, 120, 123, 130], 21",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -32 appear in [-89, -81, -80, -76, -32, -26, -21, -15, -11, -8, 10, 15, 41, 66, 67, 74, 79, 81, 88, 106, 114, 115]? Use linear search to check.","[-89, -81, -80, -76, -32, -26, -21, -15, -11, -8, 10, 15, 41, 66, 67, 74, 79, 81, 88, 106, 114, 115], -32",Element found at index 4,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 2 in the following list: [-99, -89, -87, -85, -82, -75, -74, -71, -61, -41, -39, -33, -31, -20, -19, -12, 0, 1, 8, 16, 18, 33, 45, 49, 53, 54, 56, 58, 64, 70, 71, 73, 78, 85, 93, 96, 99, 105, 115, 117, 118, 124, 130, 133, 135, 139, 141, 143, 149].","[-99, -89, -87, -85, -82, -75, -74, -71, -61, -41, -39, -33, -31, -20, -19, -12, 0, 1, 8, 16, 18, 33, 45, 49, 53, 54, 56, 58, 64, 70, 71, 73, 78, 85, 93, 96, 99, 105, 115, 117, 118, 124, 130, 133, 135, 139, 141, 143, 149], 2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -16 in the following list: [-99, -93, -85, -81, -75, -69, -68, -60, -58, -56, -47, -43, -42, -38, -37, -30, -21, -15, -14, -8, -5, -1, 1, 5, 26, 27, 43, 44, 49, 53, 54, 55, 56, 65, 81, 83, 90, 92, 95, 99, 100, 103, 112, 114, 115, 117, 131, 135, 138, 142].","[-99, -93, -85, -81, -75, -69, -68, -60, -58, -56, -47, -43, -42, -38, -37, -30, -21, -15, -14, -8, -5, -1, 1, 5, 26, 27, 43, 44, 49, 53, 54, 55, 56, 65, 81, 83, 90, 92, 95, 99, 100, 103, 112, 114, 115, 117, 131, 135, 138, 142], -16",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 59 in the following list: [-68, -34, -30, 1, 21, 46, 62, 83, 106].","[-68, -34, -30, 1, 21, 46, 62, 83, 106], 59",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 7 in the following list: [-100, -96, -86, -78, -73, -69, -67, -66, -62, -61, -60, -48, -12, -9, -7, 6, 7, 8, 20, 24, 25, 30, 40, 47, 49, 50, 55, 56, 88, 93, 104, 108, 110, 118, 119].","[-100, -96, -86, -78, -73, -69, -67, -66, -62, -61, -60, -48, -12, -9, -7, 6, 7, 8, 20, 24, 25, 30, 40, 47, 49, 50, 55, 56, 88, 93, 104, 108, 110, 118, 119], 7",Element found at index 16,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 29 in the array [-89, -72, -71, -67, -52, -45, -36, -28, -26, -22, -14, 16, 18, 22, 23, 24, 36, 56, 58, 68, 86, 88, 111, 113, 140, 146].","[-89, -72, -71, -67, -52, -45, -36, -28, -26, -22, -14, 16, 18, 22, 23, 24, 36, 56, 58, 68, 86, 88, 111, 113, 140, 146], 29",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 87 exists in [-69, -11, 47, 67, 91, 97, 112, 128].","[-69, -11, 47, 67, 91, 97, 112, 128], 87",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 47 appear in [-25, -10, 10, 25, 102, 144]? Use linear search to check.","[-25, -10, 10, 25, 102, 144], 47",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -8 in the list [-90, -89, -85, -84, -79, -76, -74, -70, -41, -27, -26, -24, -23, -21, -14, 5, 6, 7, 12, 16, 17, 21, 23, 24, 30, 31, 39, 43, 44, 45, 47, 50, 51, 60, 63, 76, 94, 96, 107, 108, 112, 116, 118, 119, 120, 130, 133, 134, 147].","[-90, -89, -85, -84, -79, -76, -74, -70, -41, -27, -26, -24, -23, -21, -14, 5, 6, 7, 12, 16, 17, 21, 23, 24, 30, 31, 39, 43, 44, 45, 47, 50, 51, 60, 63, 76, 94, 96, 107, 108, 112, 116, 118, 119, 120, 130, 133, 134, 147], -8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -46 in the list [-100, -99, -97, -94, -86, -85, -73, -70, -58, -56, -55, -52, -50, -45, -41, -39, -37, -36, -34, -31, -29, -28, -27, -19, -13, -5, -3, -1, 2, 8, 17, 31, 35, 39, 48, 51, 69, 79, 81, 84, 92, 99, 105, 115, 135, 137, 145, 149].","[-100, -99, -97, -94, -86, -85, -73, -70, -58, -56, -55, -52, -50, -45, -41, -39, -37, -36, -34, -31, -29, -28, -27, -19, -13, -5, -3, -1, 2, 8, 17, 31, 35, 39, 48, 51, 69, 79, 81, 84, 92, 99, 105, 115, 135, 137, 145, 149], -46",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 81 in the list [-96, -94, -85, -79, -64, -61, -28, -26, -22, -17, -9, -2, 8, 21, 37, 38, 40, 50, 65, 72, 74, 78, 92, 103, 112, 114, 134, 146, 148].","[-96, -94, -85, -79, -64, -61, -28, -26, -22, -17, -9, -2, 8, 21, 37, 38, 40, 50, 65, 72, 74, 78, 92, 103, 112, 114, 134, 146, 148], 81",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -18 in the following list: [-95, -94, -90, -85, -81, -78, -47, -18, -4, 25, 27, 32, 41, 46, 53, 71, 76, 92, 110, 114, 121, 122, 123, 125, 130, 135, 137, 141, 142, 148].","[-95, -94, -90, -85, -81, -78, -47, -18, -4, 25, 27, 32, 41, 46, 53, 71, 76, 92, 110, 114, 121, 122, 123, 125, 130, 135, 137, 141, 142, 148], -18",Element found at index 7,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -18 appear in [-99, -96, -93, -84, -67, -55, -52, -49, -48, -26, -22, -8, -6, 2, 11, 12, 13, 14, 31, 34, 62, 71, 75, 89, 99, 110, 146]? Use linear search to check.","[-99, -96, -93, -84, -67, -55, -52, -49, -48, -26, -22, -8, -6, 2, 11, 12, 13, 14, 31, 34, 62, 71, 75, 89, 99, 110, 146], -18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 98 exists in [-87, -85, -84, -83, -77, -73, -72, -69, -61, -49, -43, -41, -37, -30, -22, -10, -7, -6, -1, 3, 11, 14, 25, 33, 36, 41, 48, 68, 71, 79, 82, 85, 88, 93, 98, 101, 102, 103, 119, 120, 129, 135, 136, 144].","[-87, -85, -84, -83, -77, -73, -72, -69, -61, -49, -43, -41, -37, -30, -22, -10, -7, -6, -1, 3, 11, 14, 25, 33, 36, 41, 48, 68, 71, 79, 82, 85, 88, 93, 98, 101, 102, 103, 119, 120, 129, 135, 136, 144], 98",Element found at index 34,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 36 in the following list: [-74, -16, -2, 71, 92, 104, 116, 137].","[-74, -16, -2, 71, 92, 104, 116, 137], 36",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 27 exists in [-97, -94, -89, -68, -52, 69, 70].","[-97, -94, -89, -68, -52, 69, 70], 27",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 99 in the following list: [-97, -90, -71, -31, -27, -9, 15, 18, 21, 25, 52, 60, 92, 95, 106, 111, 127, 136, 140, 142, 149].","[-97, -90, -71, -31, -27, -9, 15, 18, 21, 25, 52, 60, 92, 95, 106, 111, 127, 136, 140, 142, 149], 99",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -2 in the array [-97, -89, -88, -86, -79, -78, -76, -69, -68, -62, -57, -54, -52, -51, -49, -44, -42, -35, -30, -28, -26, -22, -18, -17, -10, -9, 1, 14, 25, 30, 31, 34, 39, 40, 55, 64, 68, 70, 79, 81, 90, 96, 101, 124, 147].","[-97, -89, -88, -86, -79, -78, -76, -69, -68, -62, -57, -54, -52, -51, -49, -44, -42, -35, -30, -28, -26, -22, -18, -17, -10, -9, 1, 14, 25, 30, 31, 34, 39, 40, 55, 64, 68, 70, 79, 81, 90, 96, 101, 124, 147], -2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -27 exists in [-98, -83, -79, -77, -76, -75, -53, -43, -35, -20, -15, -5, -3, 12, 61, 70, 76, 101, 111, 148].","[-98, -83, -79, -77, -76, -75, -53, -43, -35, -20, -15, -5, -3, 12, 61, 70, 76, 101, 111, 148], -27",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -8 appear in [1, 6, 97, 103, 108, 132, 138, 142, 149]? Use linear search to check.","[1, 6, 97, 103, 108, 132, 138, 142, 149], -8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 24 in the following list: [-94, -86, -78, -56, -51, -49, -47, -46, -39, -31, -30, 1, 6, 15, 18, 31, 34, 35, 37, 40, 48, 57, 61, 72, 76, 89, 100, 103, 109, 111, 121, 125, 129, 135, 138, 148, 149].","[-94, -86, -78, -56, -51, -49, -47, -46, -39, -31, -30, 1, 6, 15, 18, 31, 34, 35, 37, 40, 48, 57, 61, 72, 76, 89, 100, 103, 109, 111, 121, 125, 129, 135, 138, 148, 149], 24",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -48 in the list [-87, -82, -73, -54, -28, 19, 22, 36, 39, 90, 96, 97, 98, 104, 105, 106, 109, 111, 123, 132, 133, 137, 148].","[-87, -82, -73, -54, -28, 19, 22, 36, 39, 90, 96, 97, 98, 104, 105, 106, 109, 111, 123, 132, 133, 137, 148], -48",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 2 in the array [-83, -77, -61, -53, -51, -33, -31, -24, -23, -21, -2, 9, 15, 18, 20, 21, 35, 36, 37, 56, 58, 60, 65, 76, 91, 96, 102, 114, 120, 123, 131, 137, 143].","[-83, -77, -61, -53, -51, -33, -31, -24, -23, -21, -2, 9, 15, 18, 20, 21, 35, 36, 37, 56, 58, 60, 65, 76, 91, 96, 102, 114, 120, 123, 131, 137, 143], 2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 40 appear in [-27, -25, 33, 61, 78, 99, 129]? Use linear search to check.","[-27, -25, 33, 61, 78, 99, 129], 40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 9 in the array [-82, -68, -66, -64, -60, -51, -42, -36, -33, -32, -27, -18, -16, -15, -13, -12, -9, 1, 8, 23, 29, 41, 48, 56, 59, 74, 76, 78, 79, 82, 89, 96, 102, 104, 109, 110, 113, 116, 129, 133, 141].","[-82, -68, -66, -64, -60, -51, -42, -36, -33, -32, -27, -18, -16, -15, -13, -12, -9, 1, 8, 23, 29, 41, 48, 56, 59, 74, 76, 78, 79, 82, 89, 96, 102, 104, 109, 110, 113, 116, 129, 133, 141], 9",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 25 appear in [-99, -81, -77, -59, -15, 9, 32, 44, 76, 102, 136]? Use linear search to check.","[-99, -81, -77, -59, -15, 9, 32, 44, 76, 102, 136], 25",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 11 in the following list: [-60, -45, -33, -15, 15, 22, 34, 78, 107, 128].","[-60, -45, -33, -15, 15, 22, 34, 78, 107, 128], 11",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 49 in the following list: [-96, -86, -62, -59, -58, -56, -44, -41, -19, -18, -17, -14, 37, 58, 73, 77, 98, 118, 127, 128, 129, 140, 141, 149].","[-96, -86, -62, -59, -58, -56, -44, -41, -19, -18, -17, -14, 37, 58, 73, 77, 98, 118, 127, 128, 129, 140, 141, 149], 49",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -31 appear in [-40, -21, -9, -7, 18, 22, 78, 118]? Use linear search to check.","[-40, -21, -9, -7, 18, 22, 78, 118], -31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 61 exists in [-78, -63, -44, -22, 51, 74, 132].","[-78, -63, -44, -22, 51, 74, 132], 61",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -39 in the list [-100, -99, -96, -94, -93, -85, -82, -81, -80, -72, -70, -68, -63, -55, -54, -50, -47, -42, -38, -33, -31, -26, -25, -22, -15, 3, 9, 24, 27, 29, 33, 38, 43, 53, 59, 60, 61, 62, 76, 89, 93, 108, 111, 112, 113, 123, 132, 143].","[-100, -99, -96, -94, -93, -85, -82, -81, -80, -72, -70, -68, -63, -55, -54, -50, -47, -42, -38, -33, -31, -26, -25, -22, -15, 3, 9, 24, 27, 29, 33, 38, 43, 53, 59, 60, 61, 62, 76, 89, 93, 108, 111, 112, 113, 123, 132, 143], -39",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 69 in the array [-100, -93, -91, -89, -86, -81, -79, -74, -61, -56, -53, -50, -46, -44, -32, -29, -28, -27, -21, -17, -13, -11, -6, -5, -1, 0, 7, 10, 27, 28, 30, 35, 37, 39, 40, 54, 67, 71, 90, 102, 103, 110, 111, 113, 121, 122, 128, 131, 132, 135].","[-100, -93, -91, -89, -86, -81, -79, -74, -61, -56, -53, -50, -46, -44, -32, -29, -28, -27, -21, -17, -13, -11, -6, -5, -1, 0, 7, 10, 27, 28, 30, 35, 37, 39, 40, 54, 67, 71, 90, 102, 103, 110, 111, 113, 121, 122, 128, 131, 132, 135], 69",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -25 in the array [-100, -69, -67, -60, 22, 30, 45, 48, 79].","[-100, -69, -67, -60, 22, 30, 45, 48, 79], -25",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -49 appear in [-84, -71, -61, -55, -40, -37, -12, -10, -5, 8, 24, 29, 40, 82, 88, 90, 104, 114, 123, 125]? Use linear search to check.","[-84, -71, -61, -55, -40, -37, -12, -10, -5, 8, 24, 29, 40, 82, 88, 90, 104, 114, 123, 125], -49",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -48 in the following list: [-99, -91, -73, -59, -58, -39, -36, -34, -25, -16, -12, -9, -7, 4, 7, 9, 31, 42, 47, 48, 54, 65, 68, 70, 87, 92, 93, 96, 102, 104, 116, 124, 125, 134, 146, 147, 148, 149].","[-99, -91, -73, -59, -58, -39, -36, -34, -25, -16, -12, -9, -7, 4, 7, 9, 31, 42, 47, 48, 54, 65, 68, 70, 87, 92, 93, 96, 102, 104, 116, 124, 125, 134, 146, 147, 148, 149], -48",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -45 in the list [-98, -94, -93, -89, -80, -76, -66, -62, -61, -59, -57, -30, -29, -27, -22, -21, -20, -5, 9, 10, 12, 13, 14, 31, 42, 45, 49, 56, 58, 60, 66, 69, 75, 93, 99, 115, 118, 119, 122, 130, 138].","[-98, -94, -93, -89, -80, -76, -66, -62, -61, -59, -57, -30, -29, -27, -22, -21, -20, -5, 9, 10, 12, 13, 14, 31, 42, 45, 49, 56, 58, 60, 66, 69, 75, 93, 99, 115, 118, 119, 122, 130, 138], -45",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -12 in the list [-70, -26, 26, 47, 50, 64, 119, 127, 134].","[-70, -26, 26, 47, 50, 64, 119, 127, 134], -12",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -44 in the list [-93, -91, -87, -86, -83, -73, -68, -64, -62, -51, -49, -40, -36, -27, -26, -24, -17, -10, -2, 1, 18, 29, 31, 36, 39, 40, 46, 53, 60, 62, 69, 73, 81, 87, 93, 94, 115, 119, 127, 128, 130, 137, 147].","[-93, -91, -87, -86, -83, -73, -68, -64, -62, -51, -49, -40, -36, -27, -26, -24, -17, -10, -2, 1, 18, 29, 31, 36, 39, 40, 46, 53, 60, 62, 69, 73, 81, 87, 93, 94, 115, 119, 127, 128, 130, 137, 147], -44",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 0 in the array [-92, -63, -59, -48, -37, -31, -20, -15, -13, 0, 5, 7, 8, 23, 45, 73, 79, 85, 93, 96, 99, 104, 122, 125, 148].","[-92, -63, -59, -48, -37, -31, -20, -15, -13, 0, 5, 7, 8, 23, 45, 73, 79, 85, 93, 96, 99, 104, 122, 125, 148], 0",Element found at index 9,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 37 in the array [-99, -96, -95, -94, -76, -60, -48, -40, -39, -32, -16, -15, -7, 2, 16, 33, 41, 43, 59, 60, 70, 77, 97, 122, 124, 128, 142].","[-99, -96, -95, -94, -76, -60, -48, -40, -39, -32, -16, -15, -7, 2, 16, 33, 41, 43, 59, 60, 70, 77, 97, 122, 124, 128, 142], 37",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 70 in the following list: [-82, -69, -6, -4, 11, 71, 104, 129, 141].","[-82, -69, -6, -4, 11, 71, 104, 129, 141], 70",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -9 in the list [-97, -88, -79, -76, -75, -74, -58, -52, -46, -45, -29, -15, -5, 6, 13, 15, 29, 31, 34, 62, 76, 87, 108, 134, 135, 139, 145].","[-97, -88, -79, -76, -75, -74, -58, -52, -46, -45, -29, -15, -5, 6, 13, 15, 29, 31, 34, 62, 76, 87, 108, 134, 135, 139, 145], -9",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 97 in the list [-94, -87, -85, -78, -77, -76, -68, -66, -65, -64, -56, -45, -19, -11, 0, 8, 17, 21, 25, 30, 45, 58, 59, 61, 65, 66, 67, 73, 75, 76, 80, 89, 95, 106, 113, 120, 131, 138, 139, 140].","[-94, -87, -85, -78, -77, -76, -68, -66, -65, -64, -56, -45, -19, -11, 0, 8, 17, 21, 25, 30, 45, 58, 59, 61, 65, 66, 67, 73, 75, 76, 80, 89, 95, 106, 113, 120, 131, 138, 139, 140], 97",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 75 appear in [-89, -87, -80, -78, -77, -76, -63, -58, -55, -51, -48, -43, -41, -37, -4, -1, 11, 17, 33, 39, 50, 51, 61, 63, 74, 76, 83, 86, 96, 104, 120, 148]? Use linear search to check.","[-89, -87, -80, -78, -77, -76, -63, -58, -55, -51, -48, -43, -41, -37, -4, -1, 11, 17, 33, 39, 50, 51, 61, 63, 74, 76, 83, 86, 96, 104, 120, 148], 75",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 52 exists in [-86, -83, -68, -67, -59, -55, -31, -16, -6, -2, 5, 24, 34, 36, 58, 67, 69, 72, 83, 103, 106, 113, 121, 122, 124].","[-86, -83, -68, -67, -59, -55, -31, -16, -6, -2, 5, 24, 34, 36, 58, 67, 69, 72, 83, 103, 106, 113, 121, 122, 124], 52",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 72 exists in [-95, -81, -72, -47, -37, -32, -29, 0, 5, 24, 36, 40, 47, 49, 59, 60, 66, 77, 113, 128].","[-95, -81, -72, -47, -37, -32, -29, 0, 5, 24, 36, 40, 47, 49, 59, 60, 66, 77, 113, 128], 72",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 19 in the list [-25, -13, 40, 54, 77, 85].","[-25, -13, 40, 54, 77, 85], 19",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -35 appear in [-93, -83, -77, -57, -52, -42, -30, -29, -21, -16, -7, 6, 26, 28, 33, 40, 54, 60, 61, 122, 138, 142]? Use linear search to check.","[-93, -83, -77, -57, -52, -42, -30, -29, -21, -16, -7, 6, 26, 28, 33, 40, 54, 60, 61, 122, 138, 142], -35",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 30 in the following list: [-97, -92, -84, -59, -52, -51, -46, -42, -37, -36, -25, -19, -7, -4, 3, 11, 15, 19, 25, 30, 31, 33, 36, 51, 60, 61, 62, 67, 68, 72, 80, 87, 96, 108, 109, 115, 116, 127, 131, 134, 141, 144, 148].","[-97, -92, -84, -59, -52, -51, -46, -42, -37, -36, -25, -19, -7, -4, 3, 11, 15, 19, 25, 30, 31, 33, 36, 51, 60, 61, 62, 67, 68, 72, 80, 87, 96, 108, 109, 115, 116, 127, 131, 134, 141, 144, 148], 30",Element found at index 19,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 33 in the following list: [-100, -62, -60, -51, -48, -31, -28, -7, 11, 16, 28, 35, 48, 53, 58, 62, 72, 73, 84, 114, 129, 130, 139].","[-100, -62, -60, -51, -48, -31, -28, -7, 11, 16, 28, 35, 48, 53, 58, 62, 72, 73, 84, 114, 129, 130, 139], 33",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 23 in the list [-92, -82, -66, -58, -57, -56, -55, -54, -50, -42, -29, -17, 27, 43, 44, 54, 64, 68, 74, 98, 106].","[-92, -82, -66, -58, -57, -56, -55, -54, -50, -42, -29, -17, 27, 43, 44, 54, 64, 68, 74, 98, 106], 23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 73 in the list [-79, -76, -62, -60, -43, -39, -38, -25, -10, 1, 8, 11, 14, 15, 16, 18, 19, 26, 40, 72, 76, 87, 115, 117, 128, 131, 135, 136, 140, 142, 144].","[-79, -76, -62, -60, -43, -39, -38, -25, -10, 1, 8, 11, 14, 15, 16, 18, 19, 26, 40, 72, 76, 87, 115, 117, 128, 131, 135, 136, 140, 142, 144], 73",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 2 exists in [-97, -90, -75, -72, -54, -49, -46, -29, -19, -17, 26, 44, 60, 62, 79, 94, 114, 123, 125, 136, 138].","[-97, -90, -75, -72, -54, -49, -46, -29, -19, -17, 26, 44, 60, 62, 79, 94, 114, 123, 125, 136, 138], 2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 45 appear in [-100, -99, -98, -97, -96, -94, -92, -78, -74, -72, -71, -70, -65, -60, -57, -52, -47, -43, -37, -35, -34, -21, -19, -17, -11, -7, 3, 16, 20, 25, 30, 36, 48, 55, 61, 63, 69, 77, 80, 91, 95, 97, 106, 108, 110, 124, 126, 134, 138, 148]? Use linear search to check.","[-100, -99, -98, -97, -96, -94, -92, -78, -74, -72, -71, -70, -65, -60, -57, -52, -47, -43, -37, -35, -34, -21, -19, -17, -11, -7, 3, 16, 20, 25, 30, 36, 48, 55, 61, 63, 69, 77, 80, 91, 95, 97, 106, 108, 110, 124, 126, 134, 138, 148], 45",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 39 exists in [-100, -94, -86, -83, -80, -69, -62, -45, -43, -32, -31, -21, -8, -7, 11, 24, 40, 43, 45, 48, 55, 89, 90, 91, 101, 118, 121, 124, 128, 131, 132, 140, 144].","[-100, -94, -86, -83, -80, -69, -62, -45, -43, -32, -31, -21, -8, -7, 11, 24, 40, 43, 45, 48, 55, 89, 90, 91, 101, 118, 121, 124, 128, 131, 132, 140, 144], 39",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 95 in the list [-73, -66, -62, -55, -54, -43, -37, -27, -15, -12, -7, 6, 9, 15, 18, 28, 33, 42, 55, 67, 70, 74, 80, 84, 85, 88, 102, 131, 146].","[-73, -66, -62, -55, -54, -43, -37, -27, -15, -12, -7, 6, 9, 15, 18, 28, 33, 42, 55, 67, 70, 74, 80, 84, 85, 88, 102, 131, 146], 95",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 36 exists in [-74, -66, -58, -36, -16, -15, -7, -6, -3, 1, 16, 17, 27, 44, 61, 77, 80, 85, 96, 107, 124].","[-74, -66, -58, -36, -16, -15, -7, -6, -3, 1, 16, 17, 27, 44, 61, 77, 80, 85, 96, 107, 124], 36",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 89 exists in [-90, -84, -82, -76, -75, -70, -65, -63, -55, -51, -45, -33, -27, -20, -15, -14, -10, -8, -4, 0, 1, 10, 12, 17, 25, 31, 44, 46, 69, 72, 79, 81, 86, 93, 98, 99, 112, 114, 119, 121, 129, 130, 131, 135, 136, 137, 138, 140, 142].","[-90, -84, -82, -76, -75, -70, -65, -63, -55, -51, -45, -33, -27, -20, -15, -14, -10, -8, -4, 0, 1, 10, 12, 17, 25, 31, 44, 46, 69, 72, 79, 81, 86, 93, 98, 99, 112, 114, 119, 121, 129, 130, 131, 135, 136, 137, 138, 140, 142], 89",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 22 in the following list: [-98, -86, -84, -82, -81, -78, -77, -68, -65, -58, -54, -53, -51, -49, -36, -26, -24, -19, -12, -11, 6, 9, 10, 13, 26, 28, 45, 46, 48, 55, 64, 72, 80, 103, 109, 113, 119, 121, 126, 128, 129, 139, 142, 144].","[-98, -86, -84, -82, -81, -78, -77, -68, -65, -58, -54, -53, -51, -49, -36, -26, -24, -19, -12, -11, 6, 9, 10, 13, 26, 28, 45, 46, 48, 55, 64, 72, 80, 103, 109, 113, 119, 121, 126, 128, 129, 139, 142, 144], 22",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 80 in the following list: [-93, -91, -85, -70, -59, -47, -23, -17, -8, -4, 2, 24, 25, 32, 36, 55, 68, 69, 75, 79, 87, 89, 98, 101, 105, 118, 140].","[-93, -91, -85, -70, -59, -47, -23, -17, -8, -4, 2, 24, 25, 32, 36, 55, 68, 69, 75, 79, 87, 89, 98, 101, 105, 118, 140], 80",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 66 in the following list: [-94, -91, -86, -84, -78, -74, -71, -69, -68, -64, -51, -50, -40, -37, -35, -25, -11, -8, -6, -5, -4, -1, 1, 5, 6, 16, 18, 24, 37, 45, 64, 70, 75, 76, 79, 83, 92, 100, 103, 112, 113, 120, 124, 130, 134, 135, 138, 140, 144].","[-94, -91, -86, -84, -78, -74, -71, -69, -68, -64, -51, -50, -40, -37, -35, -25, -11, -8, -6, -5, -4, -1, 1, 5, 6, 16, 18, 24, 37, 45, 64, 70, 75, 76, 79, 83, 92, 100, 103, 112, 113, 120, 124, 130, 134, 135, 138, 140, 144], 66",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 18 exists in [-99, -96, -92, -86, -84, -81, -64, -59, -57, -53, -52, -45, -44, -40, -37, -34, -30, -27, -25, -24, -22, -20, -15, -14, -3, 2, 9, 13, 17, 25, 35, 50, 54, 58, 60, 68, 73, 83, 88, 92, 99, 104, 112, 122, 134, 136, 140, 146, 149].","[-99, -96, -92, -86, -84, -81, -64, -59, -57, -53, -52, -45, -44, -40, -37, -34, -30, -27, -25, -24, -22, -20, -15, -14, -3, 2, 9, 13, 17, 25, 35, 50, 54, 58, 60, 68, 73, 83, 88, 92, 99, 104, 112, 122, 134, 136, 140, 146, 149], 18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 74 appear in [-97, -93, -89, -87, -83, -82, -81, -78, -67, -64, -56, -49, -39, -38, -36, -33, -5, -2, 3, 13, 14, 28, 38, 52, 57, 63, 65, 69, 76, 83, 92, 98, 114, 122, 133, 147, 148]? Use linear search to check.","[-97, -93, -89, -87, -83, -82, -81, -78, -67, -64, -56, -49, -39, -38, -36, -33, -5, -2, 3, 13, 14, 28, 38, 52, 57, 63, 65, 69, 76, 83, 92, 98, 114, 122, 133, 147, 148], 74",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 84 appear in [-87, -85, -80, -66, -57, -48, -41, -39, -36, -35, -25, -24, -13, -6, 2, 13, 17, 19, 48, 50, 56, 60, 61, 72, 74, 81, 87, 103, 116, 119, 137, 140, 146, 148]? Use linear search to check.","[-87, -85, -80, -66, -57, -48, -41, -39, -36, -35, -25, -24, -13, -6, 2, 13, 17, 19, 48, 50, 56, 60, 61, 72, 74, 81, 87, 103, 116, 119, 137, 140, 146, 148], 84",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -2 in the following list: [-93, -87, -79, -46, -33, -17, -4, -2, 10, 14, 23, 40, 41, 42, 62, 65, 70, 72, 78, 83, 87, 91, 101, 102, 107, 110, 120, 126, 136, 149].","[-93, -87, -79, -46, -33, -17, -4, -2, 10, 14, 23, 40, 41, 42, 62, 65, 70, 72, 78, 83, 87, 91, 101, 102, 107, 110, 120, 126, 136, 149], -2",Element found at index 7,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -6 in the list [-91, -90, -76, -73, -70, -67, -66, -48, -46, -45, -41, -38, -36, -23, -22, -3, 6, 10, 16, 32, 57, 64, 69, 84, 85, 118, 125, 126, 140].","[-91, -90, -76, -73, -70, -67, -66, -48, -46, -45, -41, -38, -36, -23, -22, -3, 6, 10, 16, 32, 57, 64, 69, 84, 85, 118, 125, 126, 140], -6",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -27 appear in [-67, -53, -45, 37, 60, 64, 106, 124, 128, 130, 133, 144, 145]? Use linear search to check.","[-67, -53, -45, 37, 60, 64, 106, 124, 128, 130, 133, 144, 145], -27",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 51 in the array [-94, -92, -91, -86, -76, -65, -55, -9, 14, 19, 22, 31, 35, 40, 56, 76, 97, 105, 123, 141].","[-94, -92, -91, -86, -76, -65, -55, -9, 14, 19, 22, 31, 35, 40, 56, 76, 97, 105, 123, 141], 51",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -48 in the array [-95, -93, -89, -82, -64, -61, -45, 6, 133, 136, 142].","[-95, -93, -89, -82, -64, -61, -45, 6, 133, 136, 142], -48",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -17 in the following list: [-34, -26, 27, 36, 53, 99, 135].","[-34, -26, 27, 36, 53, 99, 135], -17",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -32 appear in [1, 27, 78, 103, 104]? Use linear search to check.","[1, 27, 78, 103, 104], -32",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 90 appear in [-90, -68, -36, -3, -2, 5, 17, 22, 26, 27, 53, 54, 60, 96, 105, 129, 148]? Use linear search to check.","[-90, -68, -36, -3, -2, 5, 17, 22, 26, 27, 53, 54, 60, 96, 105, 129, 148], 90",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 1 appear in [-100, -98, -89, -79, -75, -74, -65, -53, -52, -50, -49, -36, -31, -27, -7, 2, 5, 14, 17, 20, 21, 39, 49, 52, 55, 65, 69, 73, 75, 84, 85, 90, 99, 100, 101, 111, 114, 117, 130, 133, 135, 138, 139, 144, 147]? Use linear search to check.","[-100, -98, -89, -79, -75, -74, -65, -53, -52, -50, -49, -36, -31, -27, -7, 2, 5, 14, 17, 20, 21, 39, 49, 52, 55, 65, 69, 73, 75, 84, 85, 90, 99, 100, 101, 111, 114, 117, 130, 133, 135, 138, 139, 144, 147], 1",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -48 in the following list: [-94, -55, -53, -40, -29, 33, 37, 52, 53, 61, 70, 87, 114].","[-94, -55, -53, -40, -29, 33, 37, 52, 53, 61, 70, 87, 114], -48",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 23 in the array [-78, -72, -61, -36, -35, -20, -14, -7, -4, -3, 2, 7, 10, 19, 28, 40, 43, 48, 53, 57, 60, 61, 65, 69, 92, 95, 100, 128, 139, 142].","[-78, -72, -61, -36, -35, -20, -14, -7, -4, -3, 2, 7, 10, 19, 28, 40, 43, 48, 53, 57, 60, 61, 65, 69, 92, 95, 100, 128, 139, 142], 23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 52 exists in [-91, -87, -71, -64, -39, -31, -20, -5, 33, 46, 56, 63, 67, 73, 74, 125, 126].","[-91, -87, -71, -64, -39, -31, -20, -5, 33, 46, 56, 63, 67, 73, 74, 125, 126], 52",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -17 in the array [-94, -92, -89, -82, -75, -70, -69, -68, -54, -47, -40, -39, -36, -34, -12, 0, 3, 9, 22, 35, 42, 46, 57, 63, 64, 76, 80, 81, 86, 92, 107, 125, 130, 142, 147, 149].","[-94, -92, -89, -82, -75, -70, -69, -68, -54, -47, -40, -39, -36, -34, -12, 0, 3, 9, 22, 35, 42, 46, 57, 63, 64, 76, 80, 81, 86, 92, 107, 125, 130, 142, 147, 149], -17",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 92 exists in [-80, -75, -57, -33, -2, 2, 6, 17, 26, 34, 35, 43, 47, 110, 116, 118, 132, 134].","[-80, -75, -57, -33, -2, 2, 6, 17, 26, 34, 35, 43, 47, 110, 116, 118, 132, 134], 92",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -29 in the following list: [-88, -59, -43, -33, -24, -20, -17, -15, -7, -2, 6, 7, 12, 15, 22, 27, 37, 38, 49, 70, 71, 73, 77, 82, 90, 93, 118, 125, 137, 140, 144, 149].","[-88, -59, -43, -33, -24, -20, -17, -15, -7, -2, 6, 7, 12, 15, 22, 27, 37, 38, 49, 70, 71, 73, 77, 82, 90, 93, 118, 125, 137, 140, 144, 149], -29",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 67 appear in [-94, -86, -69, -66, -63, -62, -60, -12, -4, 7, 11, 43, 57, 58, 61, 62, 68, 70, 82, 91, 99, 109, 120, 130, 133]? Use linear search to check.","[-94, -86, -69, -66, -63, -62, -60, -12, -4, 7, 11, 43, 57, 58, 61, 62, 68, 70, 82, 91, 99, 109, 120, 130, 133], 67",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -48 exists in [-98, -96, -69, -68, -56, -46, -45, -34, -31, -29, -21, -15, -11, -4, 0, 3, 8, 9, 13, 19, 26, 53, 64, 76, 79, 85, 89, 101, 103, 112, 122, 128, 133, 141, 148].","[-98, -96, -69, -68, -56, -46, -45, -34, -31, -29, -21, -15, -11, -4, 0, 3, 8, 9, 13, 19, 26, 53, 64, 76, 79, 85, 89, 101, 103, 112, 122, 128, 133, 141, 148], -48",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 83 in the following list: [-94, -85, -81, -77, -73, -66, -63, -51, -42, -41, -37, -34, -32, -30, -29, -27, -24, -19, -5, -4, 8, 16, 24, 40, 41, 52, 53, 61, 62, 69, 87, 88, 103, 115, 119, 120, 124, 127, 130, 131, 138, 139, 142, 147].","[-94, -85, -81, -77, -73, -66, -63, -51, -42, -41, -37, -34, -32, -30, -29, -27, -24, -19, -5, -4, 8, 16, 24, 40, 41, 52, 53, 61, 62, 69, 87, 88, 103, 115, 119, 120, 124, 127, 130, 131, 138, 139, 142, 147], 83",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 15 in the list [-90, -79, -75, -27, 43, 59, 62, 78, 89, 95, 129, 140, 142].","[-90, -79, -75, -27, 43, 59, 62, 78, 89, 95, 129, 140, 142], 15",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 65 in the list [-98, -97, -95, -94, -88, -85, -80, -71, -62, -61, -60, -53, -50, -41, -40, -39, -35, -33, -12, -2, 3, 13, 27, 38, 39, 43, 44, 57, 62, 69, 73, 83, 98, 103, 104, 105, 107, 111, 114, 119, 125, 126, 130, 135, 144, 145].","[-98, -97, -95, -94, -88, -85, -80, -71, -62, -61, -60, -53, -50, -41, -40, -39, -35, -33, -12, -2, 3, 13, 27, 38, 39, 43, 44, 57, 62, 69, 73, 83, 98, 103, 104, 105, 107, 111, 114, 119, 125, 126, 130, 135, 144, 145], 65",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -29 exists in [-86, -79, -77, -68, -67, -53, -52, -51, -45, -34, -23, -21, -19, -7, -4, 5, 13, 15, 18, 22, 31, 36, 37, 44, 60, 70, 86, 100, 101, 108, 117, 129, 136].","[-86, -79, -77, -68, -67, -53, -52, -51, -45, -34, -23, -21, -19, -7, -4, 5, 13, 15, 18, 22, 31, 36, 37, 44, 60, 70, 86, 100, 101, 108, 117, 129, 136], -29",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -44 in the array [-94, -86, -83, -81, -74, -67, -59, -56, -50, -47, -46, -34, -24, -10, -2, 0, 2, 3, 17, 25, 27, 28, 39, 57, 62, 65, 76, 84, 85, 87, 91, 97, 99, 109, 112, 115, 117, 128, 131, 139, 140, 142, 146, 147].","[-94, -86, -83, -81, -74, -67, -59, -56, -50, -47, -46, -34, -24, -10, -2, 0, 2, 3, 17, 25, 27, 28, 39, 57, 62, 65, 76, 84, 85, 87, 91, 97, 99, 109, 112, 115, 117, 128, 131, 139, 140, 142, 146, 147], -44",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 75 exists in [-93, -88, -65, -31, -21, -3, 10, 17, 40, 41, 46, 51, 69, 83, 84, 91, 99, 100, 106, 115, 117, 127, 133, 136].","[-93, -88, -65, -31, -21, -3, 10, 17, 40, 41, 46, 51, 69, 83, 84, 91, 99, 100, 106, 115, 117, 127, 133, 136], 75",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 49 in the following list: [-87, -65, -58, -45, -15, 3, 5, 22, 28, 44, 48, 52, 56, 67, 68, 76, 79, 80, 94, 107, 112, 117, 120, 126, 130, 132, 137].","[-87, -65, -58, -45, -15, 3, 5, 22, 28, 44, 48, 52, 56, 67, 68, 76, 79, 80, 94, 107, 112, 117, 120, 126, 130, 132, 137], 49",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 34 in the list [-90, -71, -69, -59, -46, -35, -25, -20, -14, -13, -6, 2, 7, 9, 21, 31, 34, 39, 43, 44, 46, 61, 68, 70, 71, 79, 84, 90, 93, 99, 101, 102, 114, 130, 138, 149].","[-90, -71, -69, -59, -46, -35, -25, -20, -14, -13, -6, 2, 7, 9, 21, 31, 34, 39, 43, 44, 46, 61, 68, 70, 71, 79, 84, 90, 93, 99, 101, 102, 114, 130, 138, 149], 34",Element found at index 16,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 22 exists in [-100, -99, -91, -87, -82, -77, -76, -70, -60, -56, -45, -34, -23, -18, -16, -6, 16, 18, 38, 44, 54, 66, 95, 110, 121, 138].","[-100, -99, -91, -87, -82, -77, -76, -70, -60, -56, -45, -34, -23, -18, -16, -6, 16, 18, 38, 44, 54, 66, 95, 110, 121, 138], 22",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 53 in the array [-97, -89, -75, -74, -64, -63, -58, -47, -36, -34, -33, -29, -19, 8, 16, 24, 26, 34, 67, 101, 102, 104, 122, 130, 132, 143].","[-97, -89, -75, -74, -64, -63, -58, -47, -36, -34, -33, -29, -19, 8, 16, 24, 26, 34, 67, 101, 102, 104, 122, 130, 132, 143], 53",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 62 exists in [-89, -66, -30, -29, 14, 34, 63, 84, 87, 98, 136, 144].","[-89, -66, -30, -29, 14, 34, 63, 84, 87, 98, 136, 144], 62",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 20 in the list [-86, -40, -39, -30, -18, -17, 0, 4, 9, 17, 42, 48, 54, 72, 75, 86, 88, 89, 92, 96, 118, 141].","[-86, -40, -39, -30, -18, -17, 0, 4, 9, 17, 42, 48, 54, 72, 75, 86, 88, 89, 92, 96, 118, 141], 20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -29 in the list [-86, -83, -81, -75, -68, -62, -59, -51, -45, -44, -35, -33, -24, -1, 14, 18, 19, 25, 44, 51, 54, 73, 75, 102, 103, 123, 125, 138, 140, 143].","[-86, -83, -81, -75, -68, -62, -59, -51, -45, -44, -35, -33, -24, -1, 14, 18, 19, 25, 44, 51, 54, 73, 75, 102, 103, 123, 125, 138, 140, 143], -29",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 55 in the following list: [-92, -90, -51, -38, -31, -24, -23, -17, -14, 3, 4, 11, 31, 36, 51, 57, 66, 67, 69, 71, 88, 92, 93, 103, 105, 146].","[-92, -90, -51, -38, -31, -24, -23, -17, -14, 3, 4, 11, 31, 36, 51, 57, 66, 67, 69, 71, 88, 92, 93, 103, 105, 146], 55",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 1 exists in [-99, -96, -95, -94, -75, -70, -65, -60, -53, -47, -45, -40, -37, -32, -22, -5, -4, 6, 24, 26, 27, 28, 34, 38, 42, 55, 56, 62, 68, 72, 74, 78, 87, 90, 101, 122, 131, 135, 136, 137, 147, 148].","[-99, -96, -95, -94, -75, -70, -65, -60, -53, -47, -45, -40, -37, -32, -22, -5, -4, 6, 24, 26, 27, 28, 34, 38, 42, 55, 56, 62, 68, 72, 74, 78, 87, 90, 101, 122, 131, 135, 136, 137, 147, 148], 1",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -31 in the array [-99, -86, -81, -76, -65, -53, -51, -47, -45, -43, -37, -15, -5, -3, 6, 7, 11, 18, 19, 26, 49, 51, 53, 76, 78, 79, 81, 87, 97, 98, 105, 106, 114, 115, 119, 125, 145].","[-99, -86, -81, -76, -65, -53, -51, -47, -45, -43, -37, -15, -5, -3, 6, 7, 11, 18, 19, 26, 49, 51, 53, 76, 78, 79, 81, 87, 97, 98, 105, 106, 114, 115, 119, 125, 145], -31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -35 in the following list: [-90, -76, -74, 90, 138].","[-90, -76, -74, 90, 138], -35",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 23 in the array [-73, -35, -30, -29, -10, 17, 27, 37, 62, 73, 76, 112].","[-73, -35, -30, -29, -10, 17, 27, 37, 62, 73, 76, 112], 23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -22 appear in [-83, -81, -80, -75, -63, -61, -38, -36, -35, -34, -32, -19, -18, -15, -13, -7, -4, 1, 8, 15, 16, 27, 30, 36, 37, 51, 55, 61, 71, 78, 84, 85, 92, 97, 102, 112, 120, 130, 131, 136, 143]? Use linear search to check.","[-83, -81, -80, -75, -63, -61, -38, -36, -35, -34, -32, -19, -18, -15, -13, -7, -4, 1, 8, 15, 16, 27, 30, 36, 37, 51, 55, 61, 71, 78, 84, 85, 92, 97, 102, 112, 120, 130, 131, 136, 143], -22",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 83 appear in [-98, -86, -85, -82, -81, -77, -69, -68, -65, -61, -59, -53, -50, -43, -35, -31, -25, -21, -20, -19, -12, 0, 10, 12, 17, 21, 28, 33, 41, 61, 73, 79, 81, 84, 85, 87, 92, 101, 103, 130]? Use linear search to check.","[-98, -86, -85, -82, -81, -77, -69, -68, -65, -61, -59, -53, -50, -43, -35, -31, -25, -21, -20, -19, -12, 0, 10, 12, 17, 21, 28, 33, 41, 61, 73, 79, 81, 84, 85, 87, 92, 101, 103, 130], 83",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -17 in the following list: [-100, -96, -90, -88, -85, -77, -70, -65, -60, -54, -47, -42, -36, -33, -32, -7, -1, 3, 8, 9, 14, 15, 16, 20, 37, 44, 45, 55, 62, 64, 65, 66, 69, 76, 89, 90, 112, 113, 114, 120, 133, 140, 148].","[-100, -96, -90, -88, -85, -77, -70, -65, -60, -54, -47, -42, -36, -33, -32, -7, -1, 3, 8, 9, 14, 15, 16, 20, 37, 44, 45, 55, 62, 64, 65, 66, 69, 76, 89, 90, 112, 113, 114, 120, 133, 140, 148], -17",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 88 appear in [-99, -97, -95, -90, -79, -69, -68, -66, -63, -59, -56, -43, -38, -24, -21, -14, -7, -1, 19, 22, 26, 28, 30, 37, 38, 50, 53, 67, 70, 71, 79, 82, 90, 95, 98, 101, 103, 113, 115, 121, 129, 134, 137]? Use linear search to check.","[-99, -97, -95, -90, -79, -69, -68, -66, -63, -59, -56, -43, -38, -24, -21, -14, -7, -1, 19, 22, 26, 28, 30, 37, 38, 50, 53, 67, 70, 71, 79, 82, 90, 95, 98, 101, 103, 113, 115, 121, 129, 134, 137], 88",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 27 in the list [-93, -89, -81, -62, -61, -57, -46, -29, -19, -10, 2, 3, 17, 18, 35, 39, 46, 52, 66, 85, 118, 126, 127, 128, 144].","[-93, -89, -81, -62, -61, -57, -46, -29, -19, -10, 2, 3, 17, 18, 35, 39, 46, 52, 66, 85, 118, 126, 127, 128, 144], 27",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -46 in the list [-98, -95, -82, -70, -62, -56, -53, -40, -35, -33, -28, -18, -14, 1, 19, 28, 30, 32, 36, 38, 47, 73, 77, 85, 89, 95, 96, 101, 111, 127, 138].","[-98, -95, -82, -70, -62, -56, -53, -40, -35, -33, -28, -18, -14, 1, 19, 28, 30, 32, 36, 38, 47, 73, 77, 85, 89, 95, 96, 101, 111, 127, 138], -46",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 31 in the list [-93, -81, -80, -63, -50, -49, -48, -41, -19, 3, 10, 40, 49, 69, 76, 103, 133, 143].","[-93, -81, -80, -63, -50, -49, -48, -41, -19, 3, 10, 40, 49, 69, 76, 103, 133, 143], 31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 40 in the array [-99, -92, -80, -74, -72, -70, -39, -34, -30, -25, -17, -11, 4, 8, 12, 16, 22, 23, 33, 43, 48, 49, 55, 56, 59, 62, 66, 70, 74, 76, 85, 86, 107, 115, 117, 127, 129, 130, 133].","[-99, -92, -80, -74, -72, -70, -39, -34, -30, -25, -17, -11, 4, 8, 12, 16, 22, 23, 33, 43, 48, 49, 55, 56, 59, 62, 66, 70, 74, 76, 85, 86, 107, 115, 117, 127, 129, 130, 133], 40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 4 exists in [-87, -67, -61, -57, -40, -39, -20, -19, -9, -8, -7, 10, 11, 36, 43, 48, 51, 74, 75, 88, 95, 99, 118, 121, 131, 133].","[-87, -67, -61, -57, -40, -39, -20, -19, -9, -8, -7, 10, 11, 36, 43, 48, 51, 74, 75, 88, 95, 99, 118, 121, 131, 133], 4",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 9 appear in [-100, -80, -76, -69, -56, -48, -41, -40, -37, -28, -25, -18, -7, -6, 10, 12, 18, 28, 29, 35, 42, 95, 97, 99, 100, 102, 111, 115, 120, 133, 134, 139, 147]? Use linear search to check.","[-100, -80, -76, -69, -56, -48, -41, -40, -37, -28, -25, -18, -7, -6, 10, 12, 18, 28, 29, 35, 42, 95, 97, 99, 100, 102, 111, 115, 120, 133, 134, 139, 147], 9",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -11 in the following list: [-94, -90, -86, -81, -76, -75, -74, -73, -67, -66, -62, -60, -47, -43, -24, -13, -7, -4, -3, -1, 2, 14, 17, 19, 20, 26, 34, 46, 47, 51, 54, 58, 59, 64, 72, 76, 77, 79, 83, 88, 89, 90, 102, 113, 119, 124, 128, 145].","[-94, -90, -86, -81, -76, -75, -74, -73, -67, -66, -62, -60, -47, -43, -24, -13, -7, -4, -3, -1, 2, 14, 17, 19, 20, 26, 34, 46, 47, 51, 54, 58, 59, 64, 72, 76, 77, 79, 83, 88, 89, 90, 102, 113, 119, 124, 128, 145], -11",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 0 in the array [-93, -80, -62, -58, -56, -11, -8, 42, 46, 52, 55, 68, 80, 98, 118, 133, 144].","[-93, -80, -62, -58, -56, -11, -8, 42, 46, 52, 55, 68, 80, 98, 118, 133, 144], 0",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 54 in the following list: [-75, -73, -70, -65, -55, -46, -37, -35, -30, -26, -25, -24, -18, -15, -2, 0, 5, 11, 36, 45, 47, 69, 86, 90, 91, 97, 101, 113, 114, 119, 129, 130, 135, 137].","[-75, -73, -70, -65, -55, -46, -37, -35, -30, -26, -25, -24, -18, -15, -2, 0, 5, 11, 36, 45, 47, 69, 86, 90, 91, 97, 101, 113, 114, 119, 129, 130, 135, 137], 54",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 10 in the array [-87, -73, -61, -58, -55, -37, -35, -14, -7, 2, 11, 28, 33, 35, 36, 40, 49, 89, 93, 98, 106, 109, 111, 126, 127, 129, 141, 145].","[-87, -73, -61, -58, -55, -37, -35, -14, -7, 2, 11, 28, 33, 35, 36, 40, 49, 89, 93, 98, 106, 109, 111, 126, 127, 129, 141, 145], 10",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 83 in the array [-95, -94, -86, -84, -82, -77, -67, -65, -62, -33, -30, -26, -21, -2, 5, 8, 14, 23, 36, 48, 52, 57, 58, 60, 62, 72, 84, 90, 96, 102, 103, 121, 133, 140, 141, 147].","[-95, -94, -86, -84, -82, -77, -67, -65, -62, -33, -30, -26, -21, -2, 5, 8, 14, 23, 36, 48, 52, 57, 58, 60, 62, 72, 84, 90, 96, 102, 103, 121, 133, 140, 141, 147], 83",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 65 in the following list: [-90, -75, -37, -21, -9, 40, 52, 59, 82, 127, 142, 146].","[-90, -75, -37, -21, -9, 40, 52, 59, 82, 127, 142, 146], 65",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 28 exists in [-100, -96, -89, -85, -84, -78, -77, -72, -68, -67, -66, -64, -60, -54, -51, -49, -41, -37, -27, -24, -20, -19, -13, -1, 10, 14, 18, 23, 35, 48, 63, 66, 73, 74, 79, 89, 94, 100, 118, 126, 131, 132, 142].","[-100, -96, -89, -85, -84, -78, -77, -72, -68, -67, -66, -64, -60, -54, -51, -49, -41, -37, -27, -24, -20, -19, -13, -1, 10, 14, 18, 23, 35, 48, 63, 66, 73, 74, 79, 89, 94, 100, 118, 126, 131, 132, 142], 28",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 4 in the array [-85, -84, -79, -61, -47, -38, -29, -18, -3, 0, 6, 7, 10, 11, 13, 34, 45, 46, 47, 52, 66, 71, 82, 97, 99, 107, 108, 114, 115, 132, 138].","[-85, -84, -79, -61, -47, -38, -29, -18, -3, 0, 6, 7, 10, 11, 13, 34, 45, 46, 47, 52, 66, 71, 82, 97, 99, 107, 108, 114, 115, 132, 138], 4",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 42 in the list [-90, -87, -79, -76, -62, -56, -47, -44, -39, -36, -29, -7, -4, -2, 10, 13, 19, 20, 23, 27, 30, 39, 42, 44, 57, 61, 64, 78, 79, 81, 93, 98, 110, 134, 140, 141].","[-90, -87, -79, -76, -62, -56, -47, -44, -39, -36, -29, -7, -4, -2, 10, 13, 19, 20, 23, 27, 30, 39, 42, 44, 57, 61, 64, 78, 79, 81, 93, 98, 110, 134, 140, 141], 42",Element found at index 22,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 73 in the array [-97, -94, -67, -66, -63, -61, -39, -24, -23, -17, -13, -12, -8, -1, 20, 30, 37, 40, 41, 42, 45, 52, 76, 95, 101, 106, 117, 119, 125, 129, 131, 142, 148].","[-97, -94, -67, -66, -63, -61, -39, -24, -23, -17, -13, -12, -8, -1, 20, 30, 37, 40, 41, 42, 45, 52, 76, 95, 101, 106, 117, 119, 125, 129, 131, 142, 148], 73",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 70 in the following list: [-53, -51, -49, -45, 13, 14, 92, 93, 104, 115, 139, 148].","[-53, -51, -49, -45, 13, 14, 92, 93, 104, 115, 139, 148], 70",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -27 exists in [-93, -91, -85, -81, -76, -74, -70, -62, -42, -34, -28, -24, -15, -11, -6, 9, 10, 14, 25, 34, 56, 62, 64, 72, 81, 82, 90, 91, 99, 101, 123, 125, 136, 137, 144].","[-93, -91, -85, -81, -76, -74, -70, -62, -42, -34, -28, -24, -15, -11, -6, 9, 10, 14, 25, 34, 56, 62, 64, 72, 81, 82, 90, 91, 99, 101, 123, 125, 136, 137, 144], -27",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 7 in the array [-91, -86, -60, -48, -32, -30, -25, -13, 2, 6, 16, 34, 51, 62, 63, 78, 79, 96, 100, 112, 118, 144, 149].","[-91, -86, -60, -48, -32, -30, -25, -13, 2, 6, 16, 34, 51, 62, 63, 78, 79, 96, 100, 112, 118, 144, 149], 7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -17 in the list [-99, -97, -96, -94, -92, -91, -85, -84, -83, -74, -67, -66, -63, -59, -48, -35, -33, -24, -15, -9, -8, 11, 17, 24, 27, 28, 33, 42, 51, 53, 58, 72, 90, 94, 96, 97, 100, 101, 107, 120, 121, 125, 126, 139, 143].","[-99, -97, -96, -94, -92, -91, -85, -84, -83, -74, -67, -66, -63, -59, -48, -35, -33, -24, -15, -9, -8, 11, 17, 24, 27, 28, 33, 42, 51, 53, 58, 72, 90, 94, 96, 97, 100, 101, 107, 120, 121, 125, 126, 139, 143], -17",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 1 in the list [-87, -79, -76, -70, -68, -61, -60, -53, -52, -43, -41, -35, -25, -12, -5, -3, 1, 4, 7, 8, 11, 15, 17, 20, 26, 47, 59, 65, 68, 69, 72, 74, 79, 89, 94, 95, 105, 109, 113, 116, 118, 121, 143, 144].","[-87, -79, -76, -70, -68, -61, -60, -53, -52, -43, -41, -35, -25, -12, -5, -3, 1, 4, 7, 8, 11, 15, 17, 20, 26, 47, 59, 65, 68, 69, 72, 74, 79, 89, 94, 95, 105, 109, 113, 116, 118, 121, 143, 144], 1",Element found at index 16,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -29 in the list [-100, -92, -86, -82, -75, -73, -70, -66, -65, -59, -44, -43, -41, -36, -29, -22, -19, -5, 0, 9, 15, 19, 25, 28, 32, 35, 53, 55, 59, 74, 94, 101, 102, 117, 123, 135, 137, 138].","[-100, -92, -86, -82, -75, -73, -70, -66, -65, -59, -44, -43, -41, -36, -29, -22, -19, -5, 0, 9, 15, 19, 25, 28, 32, 35, 53, 55, 59, 74, 94, 101, 102, 117, 123, 135, 137, 138], -29",Element found at index 14,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -28 appear in [-99, -80, -76, -54, -53, -35, -34, -31, -22, -21, -14, -10, 0, 13, 17, 22, 23, 25, 39, 55, 64, 65, 67, 69, 95, 106, 133, 134, 138, 144]? Use linear search to check.","[-99, -80, -76, -54, -53, -35, -34, -31, -22, -21, -14, -10, 0, 13, 17, 22, 23, 25, 39, 55, 64, 65, 67, 69, 95, 106, 133, 134, 138, 144], -28",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 76 exists in [-91, -82, -74, -65, -48, -46, -33, -31, -24, 22, 26, 27, 33, 40, 58, 61, 79, 105].","[-91, -82, -74, -65, -48, -46, -33, -31, -24, 22, 26, 27, 33, 40, 58, 61, 79, 105], 76",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 80 in the list [-100, -99, -95, -91, -77, -71, -70, -67, -65, -64, -38, -33, -18, -15, -9, -2, 6, 10, 33, 34, 35, 40, 50, 52, 57, 59, 72, 76, 79, 86, 88, 103, 106, 107, 109, 110, 111, 119, 123, 126, 134, 138, 142, 146, 147].","[-100, -99, -95, -91, -77, -71, -70, -67, -65, -64, -38, -33, -18, -15, -9, -2, 6, 10, 33, 34, 35, 40, 50, 52, 57, 59, 72, 76, 79, 86, 88, 103, 106, 107, 109, 110, 111, 119, 123, 126, 134, 138, 142, 146, 147], 80",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 32 in the array [-100, -97, -82, -78, -74, -73, -70, -63, -60, -58, -51, -50, -49, -48, -43, -35, -32, -18, -13, -12, 4, 17, 26, 36, 46, 48, 50, 74, 82, 88, 93, 98, 110, 111, 122, 132, 138, 139, 141, 143, 147].","[-100, -97, -82, -78, -74, -73, -70, -63, -60, -58, -51, -50, -49, -48, -43, -35, -32, -18, -13, -12, 4, 17, 26, 36, 46, 48, 50, 74, 82, 88, 93, 98, 110, 111, 122, 132, 138, 139, 141, 143, 147], 32",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 36 in the following list: [-91, -90, -79, -63, -58, -56, -46, -43, -39, 3, 7, 28, 43, 44, 51, 52, 77, 82, 87, 115, 120, 124].","[-91, -90, -79, -63, -58, -56, -46, -43, -39, 3, 7, 28, 43, 44, 51, 52, 77, 82, 87, 115, 120, 124], 36",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -12 appear in [-61, -39, -37, 4, 44, 56, 68, 86, 97, 107, 113, 121, 137, 143, 145, 148]? Use linear search to check.","[-61, -39, -37, 4, 44, 56, 68, 86, 97, 107, 113, 121, 137, 143, 145, 148], -12",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 0 in the array [-98, -95, -92, -83, -82, -78, -60, -51, -49, -36, -35, -23, -22, -13, -3, -1, 2, 5, 6, 8, 11, 17, 18, 24, 26, 32, 46, 48, 66, 75, 92, 95, 96, 115, 144, 146].","[-98, -95, -92, -83, -82, -78, -60, -51, -49, -36, -35, -23, -22, -13, -3, -1, 2, 5, 6, 8, 11, 17, 18, 24, 26, 32, 46, 48, 66, 75, 92, 95, 96, 115, 144, 146], 0",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 52 in the list [-93, -87, -72, -70, -62, -57, -55, -53, -51, -38, -36, -19, -17, -13, -8, -1, 4, 12, 16, 25, 28, 35, 37, 38, 53, 68, 69, 70, 74, 78, 79, 86, 96, 104, 108, 109, 112, 114, 120, 124, 129, 143, 144, 149].","[-93, -87, -72, -70, -62, -57, -55, -53, -51, -38, -36, -19, -17, -13, -8, -1, 4, 12, 16, 25, 28, 35, 37, 38, 53, 68, 69, 70, 74, 78, 79, 86, 96, 104, 108, 109, 112, 114, 120, 124, 129, 143, 144, 149], 52",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -26 exists in [-95, -90, -80, -78, -69, -68, -67, -61, -58, -54, -51, -47, -35, -25, -24, -17, -7, -4, 3, 12, 13, 20, 32, 41, 43, 49, 57, 63, 65, 80, 81, 85, 87, 90, 95, 107, 117, 119, 120, 123, 127, 132, 134, 141, 143, 147, 148].","[-95, -90, -80, -78, -69, -68, -67, -61, -58, -54, -51, -47, -35, -25, -24, -17, -7, -4, 3, 12, 13, 20, 32, 41, 43, 49, 57, 63, 65, 80, 81, 85, 87, 90, 95, 107, 117, 119, 120, 123, 127, 132, 134, 141, 143, 147, 148], -26",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 91 appear in [-90, -86, -76, -58, -23, 18, 26, 32, 43, 52, 83, 104, 111, 112]? Use linear search to check.","[-90, -86, -76, -58, -23, 18, 26, 32, 43, 52, 83, 104, 111, 112], 91",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 91 in the array [-90, -89, -87, -42, -1, 1, 8, 57, 63, 84, 124].","[-90, -89, -87, -42, -1, 1, 8, 57, 63, 84, 124], 91",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -27 in the following list: [-84, -74, -52, -21, -12, 14, 33, 104, 121, 147].","[-84, -74, -52, -21, -12, 14, 33, 104, 121, 147], -27",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 32 in the list [-89, -83, -81, -78, -65, -58, -40, -32, -26, -23, -19, -12, 2, 6, 10, 37, 52, 72, 81, 83, 88, 89, 91, 97, 102, 104, 107, 110, 113, 126, 127, 128, 143].","[-89, -83, -81, -78, -65, -58, -40, -32, -26, -23, -19, -12, 2, 6, 10, 37, 52, 72, 81, 83, 88, 89, 91, 97, 102, 104, 107, 110, 113, 126, 127, 128, 143], 32",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -40 exists in [-90, -82, -68, -66, -62, -61, -46, -39, -34, -23, -19, -15, -13, -7, 7, 15, 18, 37, 47, 61, 65, 91, 99, 101, 109, 110, 111, 118, 130, 141].","[-90, -82, -68, -66, -62, -61, -46, -39, -34, -23, -19, -15, -13, -7, 7, 15, 18, 37, 47, 61, 65, 91, 99, 101, 109, 110, 111, 118, 130, 141], -40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 68 appear in [-100, -97, -96, -95, -92, -55, -54, -52, -47, -41, -34, 2, 12, 17, 18, 29, 31, 33, 35, 38, 41, 58, 64, 76, 77, 80, 81, 83, 98, 99, 100, 101, 102, 104, 105, 118, 119, 125, 126, 136, 139, 142]? Use linear search to check.","[-100, -97, -96, -95, -92, -55, -54, -52, -47, -41, -34, 2, 12, 17, 18, 29, 31, 33, 35, 38, 41, 58, 64, 76, 77, 80, 81, 83, 98, 99, 100, 101, 102, 104, 105, 118, 119, 125, 126, 136, 139, 142], 68",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 52 in the array [-81, -79, -64, -61, -60, -56, -44, -35, -27, -24, -15, -7, -2, 13, 22, 25, 41, 53, 83, 85, 86, 89, 104, 109, 132, 142, 143].","[-81, -79, -64, -61, -60, -56, -44, -35, -27, -24, -15, -7, -2, 13, 22, 25, 41, 53, 83, 85, 86, 89, 104, 109, 132, 142, 143], 52",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -29 in the list [-88, -77, -75, -39, -36, -17, 4, 20, 24, 34, 49, 53, 57, 74, 77, 78, 94, 96, 99, 136, 138, 142].","[-88, -77, -75, -39, -36, -17, 4, 20, 24, 34, 49, 53, 57, 74, 77, 78, 94, 96, 99, 136, 138, 142], -29",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 42 exists in [-99, -92, -84, -83, -75, -74, -69, -65, -57, -41, -26, -20, -17, -1, 7, 9, 10, 34, 38, 40, 44, 53, 59, 63, 64, 69, 73, 75, 80, 81, 82, 84, 93, 104, 109, 110, 112, 113, 116, 127, 139, 142].","[-99, -92, -84, -83, -75, -74, -69, -65, -57, -41, -26, -20, -17, -1, 7, 9, 10, 34, 38, 40, 44, 53, 59, 63, 64, 69, 73, 75, 80, 81, 82, 84, 93, 104, 109, 110, 112, 113, 116, 127, 139, 142], 42",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 91 in the list [-99, -50, -26, -13, 30, 34, 50, 82, 111].","[-99, -50, -26, -13, 30, 34, 50, 82, 111], 91",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 71 in the list [-86, -81, -55, -49, -25, -7, -6, -3, 19, 117, 121, 131].","[-86, -81, -55, -49, -25, -7, -6, -3, 19, 117, 121, 131], 71",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -49 exists in [-86, -78, -53, -45, -23, 19, 44, 61, 63, 64, 65, 82, 83, 127].","[-86, -78, -53, -45, -23, 19, 44, 61, 63, 64, 65, 82, 83, 127], -49",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -18 in the list [-93, -92, -87, -71, -60, -57, -34, -32, -25, -24, -23, -11, -1, 5, 13, 17, 20, 26, 37, 42, 50, 65, 78, 83, 93, 97, 102, 109, 123, 126, 131, 134, 140, 143, 148].","[-93, -92, -87, -71, -60, -57, -34, -32, -25, -24, -23, -11, -1, 5, 13, 17, 20, 26, 37, 42, 50, 65, 78, 83, 93, 97, 102, 109, 123, 126, 131, 134, 140, 143, 148], -18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -28 in the array [-96, -92, -87, -82, -54, -39, -36, -16, 16, 48, 51, 84, 94, 115, 124, 130].","[-96, -92, -87, -82, -54, -39, -36, -16, 16, 48, 51, 84, 94, 115, 124, 130], -28",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -3 in the following list: [-83, -73, -63, -45, -35, -28, -15, 28, 44, 52, 65, 113, 127].","[-83, -73, -63, -45, -35, -28, -15, 28, 44, 52, 65, 113, 127], -3",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 81 appear in [-98, -97, -96, -87, -86, -80, -79, -74, -67, -45, -37, -27, -11, -5, 7, 14, 16, 36, 41, 52, 66, 83, 95, 102, 110, 133]? Use linear search to check.","[-98, -97, -96, -87, -86, -80, -79, -74, -67, -45, -37, -27, -11, -5, 7, 14, 16, 36, 41, 52, 66, 83, 95, 102, 110, 133], 81",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -7 in the array [-90, -86, -73, -69, -41, -37, -36, -31, 6, 8, 12, 19, 22, 39, 42, 56, 60, 77, 84, 112, 120, 124, 142, 148].","[-90, -86, -73, -69, -41, -37, -36, -31, 6, 8, 12, 19, 22, 39, 42, 56, 60, 77, 84, 112, 120, 124, 142, 148], -7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 31 exists in [-63, -39, -26, 4, 28, 65, 85, 136].","[-63, -39, -26, 4, 28, 65, 85, 136], 31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 74 in the list [-92, -86, -29, -18, -17, -16, 27, 38, 54, 81, 91, 95, 104, 125, 143].","[-92, -86, -29, -18, -17, -16, 27, 38, 54, 81, 91, 95, 104, 125, 143], 74",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 47 in the array [-97, -87, -85, -77, -75, -73, -70, -58, -52, -45, -40, -39, -30, -29, -23, -20, -15, -14, -11, 0, 8, 9, 15, 20, 38, 50, 60, 64, 68, 69, 74, 81, 83, 86, 90, 93, 101, 116, 120, 121, 132, 144, 145].","[-97, -87, -85, -77, -75, -73, -70, -58, -52, -45, -40, -39, -30, -29, -23, -20, -15, -14, -11, 0, 8, 9, 15, 20, 38, 50, 60, 64, 68, 69, 74, 81, 83, 86, 90, 93, 101, 116, 120, 121, 132, 144, 145], 47",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -7 exists in [-98, -92, -90, -86, -83, -75, -67, -63, -51, -42, -34, -15, -8, 0, 27, 37, 40, 44, 45, 51, 62, 64, 74, 90, 95, 121, 131, 143, 148].","[-98, -92, -90, -86, -83, -75, -67, -63, -51, -42, -34, -15, -8, 0, 27, 37, 40, 44, 45, 51, 62, 64, 74, 90, 95, 121, 131, 143, 148], -7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 29 appear in [-54, -35, -14, 70, 112, 121, 124, 140, 148]? Use linear search to check.","[-54, -35, -14, 70, 112, 121, 124, 140, 148], 29",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 55 exists in [-95, -90, -87, -82, -53, -49, -36, -28, -14, 37, 41, 63, 68, 69, 116, 126, 145, 149].","[-95, -90, -87, -82, -53, -49, -36, -28, -14, 37, 41, 63, 68, 69, 116, 126, 145, 149], 55",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 3 appear in [-60, -58, -51, -26, -19, -6, -2, 25, 39, 59, 73, 80, 81, 83, 145, 146]? Use linear search to check.","[-60, -58, -51, -26, -19, -6, -2, 25, 39, 59, 73, 80, 81, 83, 145, 146], 3",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 40 in the array [-100, -74, -67, -59, -57, -52, -49, -43, -41, -29, -18, -2, -1, 2, 9, 28, 31, 33, 73, 91, 92, 106, 122, 129, 135, 137, 144, 148].","[-100, -74, -67, -59, -57, -52, -49, -43, -41, -29, -18, -2, -1, 2, 9, 28, 31, 33, 73, 91, 92, 106, 122, 129, 135, 137, 144, 148], 40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 98 in the list [-87, -83, -72, -71, -67, -54, -50, -47, -46, -42, -20, -15, -14, -10, 0, 12, 16, 19, 39, 40, 43, 51, 54, 63, 67, 72, 101, 102, 110, 117, 123, 127, 138, 148].","[-87, -83, -72, -71, -67, -54, -50, -47, -46, -42, -20, -15, -14, -10, 0, 12, 16, 19, 39, 40, 43, 51, 54, 63, 67, 72, 101, 102, 110, 117, 123, 127, 138, 148], 98",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -33 in the array [-97, -90, -89, -69, -62, -58, -53, -50, -45, -34, -28, -19, -11, -6, -5, 2, 7, 10, 13, 14, 15, 19, 22, 24, 28, 35, 37, 46, 50, 51, 54, 55, 58, 62, 64, 72, 75, 77, 80, 88, 92, 93, 95, 109, 111, 125, 128, 131, 134, 137].","[-97, -90, -89, -69, -62, -58, -53, -50, -45, -34, -28, -19, -11, -6, -5, 2, 7, 10, 13, 14, 15, 19, 22, 24, 28, 35, 37, 46, 50, 51, 54, 55, 58, 62, 64, 72, 75, 77, 80, 88, 92, 93, 95, 109, 111, 125, 128, 131, 134, 137], -33",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 21 appear in [-98, -40, -5, -1, 2, 8, 20, 31, 59, 81, 109, 131, 142]? Use linear search to check.","[-98, -40, -5, -1, 2, 8, 20, 31, 59, 81, 109, 131, 142], 21",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 7 in the following list: [-100, -95, -89, -81, -76, -72, -58, -34, -33, -30, -23, -10, 0, 3, 16, 21, 23, 38, 42, 47, 49, 54, 67, 78, 79, 89, 94, 96, 99, 106, 118, 130, 134, 136, 143, 146, 149].","[-100, -95, -89, -81, -76, -72, -58, -34, -33, -30, -23, -10, 0, 3, 16, 21, 23, 38, 42, 47, 49, 54, 67, 78, 79, 89, 94, 96, 99, 106, 118, 130, 134, 136, 143, 146, 149], 7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -19 in the array [-95, -83, -80, -79, -57, -52, -51, -50, -45, -36, -34, -30, -21, -17, -15, -6, 1, 6, 16, 26, 29, 31, 35, 55, 66, 75, 79, 94, 106, 115, 116, 121, 122, 126, 134, 137, 138, 147].","[-95, -83, -80, -79, -57, -52, -51, -50, -45, -36, -34, -30, -21, -17, -15, -6, 1, 6, 16, 26, 29, 31, 35, 55, 66, 75, 79, 94, 106, 115, 116, 121, 122, 126, 134, 137, 138, 147], -19",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 47 in the array [-82, -76, -68, -51, -50, -48, -46, -42, -40, -11, 6, 12, 13, 26, 50, 53, 54, 61, 64, 67, 70, 77, 79, 87, 91, 100, 107, 118, 120, 130, 131, 132, 143].","[-82, -76, -68, -51, -50, -48, -46, -42, -40, -11, 6, 12, 13, 26, 50, 53, 54, 61, 64, 67, 70, 77, 79, 87, 91, 100, 107, 118, 120, 130, 131, 132, 143], 47",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 64 in the array [-82, -65, -55, -20, -16, 7, 12, 41, 51, 53, 72, 87, 98, 101, 127, 128, 134, 135, 149].","[-82, -65, -55, -20, -16, 7, 12, 41, 51, 53, 72, 87, 98, 101, 127, 128, 134, 135, 149], 64",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 93 in the array [-92, -60, -59, -58, -57, -12, -9, 2, 10, 18, 24, 37, 38, 63, 66, 106, 108, 126, 130, 137].","[-92, -60, -59, -58, -57, -12, -9, 2, 10, 18, 24, 37, 38, 63, 66, 106, 108, 126, 130, 137], 93",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 4 appear in [-93, -65, -48, -13, 1, 3, 5, 6, 11, 15, 17, 24, 30, 44, 45, 73, 88, 114, 130, 138]? Use linear search to check.","[-93, -65, -48, -13, 1, 3, 5, 6, 11, 15, 17, 24, 30, 44, 45, 73, 88, 114, 130, 138], 4",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 100 in the following list: [-94, -83, -81, -78, -77, -68, -66, -65, -55, -51, -48, -43, -37, -27, -20, -18, 6, 7, 25, 42, 53, 77, 78, 85, 88, 131, 136, 138, 148, 149].","[-94, -83, -81, -78, -77, -68, -66, -65, -55, -51, -48, -43, -37, -27, -20, -18, 6, 7, 25, 42, 53, 77, 78, 85, 88, 131, 136, 138, 148, 149], 100",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 11 in the list [-90, -75, -43, -8, 11, 18, 41, 70, 117, 138, 140, 143].","[-90, -75, -43, -8, 11, 18, 41, 70, 117, 138, 140, 143], 11",Element found at index 4,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 94 in the following list: [-93, -91, -82, -71, -68, -63, -59, -33, -27, -23, -14, -12, 1, 2, 13, 20, 92, 100, 101, 105, 111, 123, 131, 133, 134, 137, 138, 143, 146].","[-93, -91, -82, -71, -68, -63, -59, -33, -27, -23, -14, -12, 1, 2, 13, 20, 92, 100, 101, 105, 111, 123, 131, 133, 134, 137, 138, 143, 146], 94",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -17 exists in [-67, -53, -41, -35, -4, 14, 56, 105].","[-67, -53, -41, -35, -4, 14, 56, 105], -17",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 71 exists in [-98, -91, -90, -89, -84, -74, -73, -69, -59, -52, -51, -40, -37, -30, -24, -23, -3, 6, 10, 11, 14, 20, 24, 36, 37, 41, 53, 55, 60, 61, 67, 70, 71, 76, 81, 83, 89, 91, 94, 101, 103, 107, 112, 124, 142, 144, 149].","[-98, -91, -90, -89, -84, -74, -73, -69, -59, -52, -51, -40, -37, -30, -24, -23, -3, 6, 10, 11, 14, 20, 24, 36, 37, 41, 53, 55, 60, 61, 67, 70, 71, 76, 81, 83, 89, 91, 94, 101, 103, 107, 112, 124, 142, 144, 149], 71",Element found at index 32,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 53 in the array [-91, -80, -33, -27, -20, -18, -13, -10, -4, -3, 34, 36, 42, 48, 57, 81, 88, 101, 104, 108, 116, 128, 131, 137, 142, 149].","[-91, -80, -33, -27, -20, -18, -13, -10, -4, -3, 34, 36, 42, 48, 57, 81, 88, 101, 104, 108, 116, 128, 131, 137, 142, 149], 53",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 32 in the array [-96, -90, -69, -59, -54, -43, -28, 11, 20, 25, 26, 46, 49, 50, 88, 103, 113, 131, 139].","[-96, -90, -69, -59, -54, -43, -28, 11, 20, 25, 26, 46, 49, 50, 88, 103, 113, 131, 139], 32",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -9 in the array [-95, -86, -72, -71, -68, -31, -28, -23, -11, -10, 1, 34, 39, 60, 61, 62, 95, 110, 145].","[-95, -86, -72, -71, -68, -31, -28, -23, -11, -10, 1, 34, 39, 60, 61, 62, 95, 110, 145], -9",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 10 in the following list: [-98, -97, -94, -89, -86, -85, -82, -73, -49, -41, -36, -32, -14, -8, -1, 20, 21, 26, 38, 42, 43, 50, 61, 65, 77, 104, 115, 125, 130, 133, 139, 146].","[-98, -97, -94, -89, -86, -85, -82, -73, -49, -41, -36, -32, -14, -8, -1, 20, 21, 26, 38, 42, 43, 50, 61, 65, 77, 104, 115, 125, 130, 133, 139, 146], 10",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 15 in the list [-92, -87, -85, -70, -59, -54, -53, -52, -42, -39, -36, -34, -9, -4, 7, 10, 15, 16, 18, 26, 41, 43, 45, 48, 57, 66, 74, 75, 77, 78, 86, 101, 113, 114, 115, 117, 127, 128, 132, 146].","[-92, -87, -85, -70, -59, -54, -53, -52, -42, -39, -36, -34, -9, -4, 7, 10, 15, 16, 18, 26, 41, 43, 45, 48, 57, 66, 74, 75, 77, 78, 86, 101, 113, 114, 115, 117, 127, 128, 132, 146], 15",Element found at index 16,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 15 in the following list: [-96, -89, -86, -84, -79, -65, -64, -59, -57, -56, -51, -38, -37, -15, -1, 16, 25, 35, 42, 61, 71, 86, 94, 95, 116, 121, 130].","[-96, -89, -86, -84, -79, -65, -64, -59, -57, -56, -51, -38, -37, -15, -1, 16, 25, 35, 42, 61, 71, 86, 94, 95, 116, 121, 130], 15",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 49 in the array [-93, -83, -71, -69, -54, -53, -49, -48, -43, -39, -37, -35, -7, -4, -3, 7, 8, 27, 30, 35, 40, 42, 51, 53, 71, 72, 79, 80, 85, 101, 104, 105, 138, 141, 145, 146, 148].","[-93, -83, -71, -69, -54, -53, -49, -48, -43, -39, -37, -35, -7, -4, -3, 7, 8, 27, 30, 35, 40, 42, 51, 53, 71, 72, 79, 80, 85, 101, 104, 105, 138, 141, 145, 146, 148], 49",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 72 in the array [-94, -22, -21, -1, 1, 14, 28, 52, 53, 78, 79, 100].","[-94, -22, -21, -1, 1, 14, 28, 52, 53, 78, 79, 100], 72",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -12 appear in [-99, -98, -95, -88, -85, -78, -72, -69, -46, -38, -34, -30, -23, -21, -15, -6, 0, 4, 6, 8, 26, 28, 31, 34, 53, 65, 89, 91, 92, 94, 96, 97, 104, 116, 125, 126, 134, 139, 140, 147, 149]? Use linear search to check.","[-99, -98, -95, -88, -85, -78, -72, -69, -46, -38, -34, -30, -23, -21, -15, -6, 0, 4, 6, 8, 26, 28, 31, 34, 53, 65, 89, 91, 92, 94, 96, 97, 104, 116, 125, 126, 134, 139, 140, 147, 149], -12",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 77 in the array [-95, -91, -85, -82, -73, -69, -68, -64, -63, -61, -48, -43, -41, -23, -19, -8, -5, 0, 1, 4, 13, 16, 18, 36, 52, 56, 63, 66, 70, 74, 84, 85, 90, 93, 100, 101, 104, 119, 124, 143, 145, 147, 148].","[-95, -91, -85, -82, -73, -69, -68, -64, -63, -61, -48, -43, -41, -23, -19, -8, -5, 0, 1, 4, 13, 16, 18, 36, 52, 56, 63, 66, 70, 74, 84, 85, 90, 93, 100, 101, 104, 119, 124, 143, 145, 147, 148], 77",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 69 appear in [-68, -62, -59, -46, -23, -22, -8, 16, 57, 59, 99, 116, 125, 137, 149]? Use linear search to check.","[-68, -62, -59, -46, -23, -22, -8, 16, 57, 59, 99, 116, 125, 137, 149], 69",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -2 exists in [-100, -99, -95, -94, -90, -82, -71, -65, -63, -57, -51, -36, -35, -33, -28, -25, -12, -11, -5, 3, 9, 23, 25, 27, 28, 30, 36, 40, 44, 46, 48, 60, 67, 70, 82, 86, 87, 98, 104, 106, 117, 119, 123, 126, 141, 144, 146, 149].","[-100, -99, -95, -94, -90, -82, -71, -65, -63, -57, -51, -36, -35, -33, -28, -25, -12, -11, -5, 3, 9, 23, 25, 27, 28, 30, 36, 40, 44, 46, 48, 60, 67, 70, 82, 86, 87, 98, 104, 106, 117, 119, 123, 126, 141, 144, 146, 149], -2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -32 exists in [-42, -29, -21, -12, 16, 48, 58, 67, 83, 147].","[-42, -29, -21, -12, 16, 48, 58, 67, 83, 147], -32",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 65 in the array [-92, -89, -55, -44, -8, 13, 18, 30, 33, 35, 50, 68, 69, 72, 84, 89, 95, 105, 112, 117, 119, 120, 143].","[-92, -89, -55, -44, -8, 13, 18, 30, 33, 35, 50, 68, 69, 72, 84, 89, 95, 105, 112, 117, 119, 120, 143], 65",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 48 exists in [-100, -94, -85, -78, -75, -70, -64, -57, -47, -31, -26, -20, -18, -12, -8, -5, 13, 17, 25, 28, 34, 37, 41, 49, 53, 55, 56, 57, 59, 70, 74, 98, 100, 107, 121, 124, 125, 130, 131, 132, 134, 140, 142, 148].","[-100, -94, -85, -78, -75, -70, -64, -57, -47, -31, -26, -20, -18, -12, -8, -5, 13, 17, 25, 28, 34, 37, 41, 49, 53, 55, 56, 57, 59, 70, 74, 98, 100, 107, 121, 124, 125, 130, 131, 132, 134, 140, 142, 148], 48",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -27 appear in [-55, -10, 4, 44, 46, 68, 79, 83, 126, 142]? Use linear search to check.","[-55, -10, 4, 44, 46, 68, 79, 83, 126, 142], -27",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 49 in the following list: [-61, -51, 102, 106, 120, 141].","[-61, -51, 102, 106, 120, 141], 49",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 1 in the list [-86, -75, -58, -44, -37, -21, -15, 0, 8, 9, 19, 30, 31, 44, 45, 53, 55, 61, 99, 115, 119, 145, 149].","[-86, -75, -58, -44, -37, -21, -15, 0, 8, 9, 19, 30, 31, 44, 45, 53, 55, 61, 99, 115, 119, 145, 149], 1",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -22 in the array [-93, -59, -54, -21, -2, 11, 44, 55, 70, 83, 88, 111, 123, 129, 133].","[-93, -59, -54, -21, -2, 11, 44, 55, 70, 83, 88, 111, 123, 129, 133], -22",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -14 in the following list: [-23, 42, 77, 88, 121, 126, 143, 145].","[-23, 42, 77, 88, 121, 126, 143, 145], -14",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 51 exists in [-93, -88, -66, -62, -59, -53, -52, -50, -48, -47, -42, -31, -30, -27, -22, -13, -10, -8, -5, -3, 1, 7, 10, 25, 37, 39, 43, 48, 50, 51, 52, 59, 67, 68, 80, 85, 90, 97, 109, 110, 113, 116, 119, 124, 128, 134, 146].","[-93, -88, -66, -62, -59, -53, -52, -50, -48, -47, -42, -31, -30, -27, -22, -13, -10, -8, -5, -3, 1, 7, 10, 25, 37, 39, 43, 48, 50, 51, 52, 59, 67, 68, 80, 85, 90, 97, 109, 110, 113, 116, 119, 124, 128, 134, 146], 51",Element found at index 29,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 73 in the array [-96, -95, -83, -82, -76, -61, -58, -55, -36, -34, -33, -31, -25, -24, -23, -12, -10, -2, 3, 8, 9, 19, 22, 26, 31, 34, 41, 42, 46, 76, 83, 84, 92, 96, 97, 103, 105, 111, 112, 116, 118, 127, 129, 131, 135, 143, 144, 146, 147].","[-96, -95, -83, -82, -76, -61, -58, -55, -36, -34, -33, -31, -25, -24, -23, -12, -10, -2, 3, 8, 9, 19, 22, 26, 31, 34, 41, 42, 46, 76, 83, 84, 92, 96, 97, 103, 105, 111, 112, 116, 118, 127, 129, 131, 135, 143, 144, 146, 147], 73",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 40 appear in [-96, -88, -87, -75, -67, -47, -38, -37, -21, -18, -15, -4, 6, 13, 35, 56, 69, 75, 80, 81, 87, 91, 92, 98, 104, 112, 120, 124, 128, 145]? Use linear search to check.","[-96, -88, -87, -75, -67, -47, -38, -37, -21, -18, -15, -4, 6, 13, 35, 56, 69, 75, 80, 81, 87, 91, 92, 98, 104, 112, 120, 124, 128, 145], 40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 64 in the list [-97, -93, -76, -23, -14, -12, -4, 5, 43, 103, 107, 129].","[-97, -93, -76, -23, -14, -12, -4, 5, 43, 103, 107, 129], 64",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -45 in the list [-97, -95, -91, -86, -85, -78, -74, -66, -64, -60, -59, -56, -55, -34, -29, -24, -18, -17, -15, -8, 18, 23, 30, 39, 41, 44, 45, 52, 54, 57, 72, 75, 82, 83, 88, 90, 94, 95, 101, 105, 113, 116, 118, 124, 128, 134, 136, 139, 145, 146].","[-97, -95, -91, -86, -85, -78, -74, -66, -64, -60, -59, -56, -55, -34, -29, -24, -18, -17, -15, -8, 18, 23, 30, 39, 41, 44, 45, 52, 54, 57, 72, 75, 82, 83, 88, 90, 94, 95, 101, 105, 113, 116, 118, 124, 128, 134, 136, 139, 145, 146], -45",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -34 in the list [-66, 25, 41, 52, 66, 72].","[-66, 25, 41, 52, 66, 72], -34",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 37 exists in [-99, -35, -15, -7, 19, 77, 135].","[-99, -35, -15, -7, 19, 77, 135], 37",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 32 exists in [-90, -80, -79, -74, -73, -53, -46, -37, -28, -2, -1, 5, 22, 47, 59, 62, 69, 75, 86, 98, 112, 117, 127].","[-90, -80, -79, -74, -73, -53, -46, -37, -28, -2, -1, 5, 22, 47, 59, 62, 69, 75, 86, 98, 112, 117, 127], 32",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -17 appear in [-73, -70, -62, -60, -58, -48, -45, -40, -34, -30, -21, 2, 11, 16, 25, 27, 30, 35, 36, 37, 42, 45, 59, 66, 67, 74, 75, 76, 79, 84, 97, 105, 126, 131, 134, 139]? Use linear search to check.","[-73, -70, -62, -60, -58, -48, -45, -40, -34, -30, -21, 2, 11, 16, 25, 27, 30, 35, 36, 37, 42, 45, 59, 66, 67, 74, 75, 76, 79, 84, 97, 105, 126, 131, 134, 139], -17",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 56 in the array [-42, -25, -24, 22, 59, 81, 142, 146].","[-42, -25, -24, 22, 59, 81, 142, 146], 56",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 13 in the array [-82, -71, -32, -29, -19, -8, 12, 26, 40, 51, 54, 61, 68, 118, 124, 142].","[-82, -71, -32, -29, -19, -8, 12, 26, 40, 51, 54, 61, 68, 118, 124, 142], 13",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 99 in the array [-85, -69, -49, -38, -22, -9, 6, 11, 86, 97, 115, 138, 141, 147].","[-85, -69, -49, -38, -22, -9, 6, 11, 86, 97, 115, 138, 141, 147], 99",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -33 in the following list: [-90, -85, -73, -70, -44, -43, -33, -21, -11, -6, -5, 10, 12, 21, 29, 32, 36, 42, 46, 52, 83, 116, 120, 130, 135, 141, 148].","[-90, -85, -73, -70, -44, -43, -33, -21, -11, -6, -5, 10, 12, 21, 29, 32, 36, 42, 46, 52, 83, 116, 120, 130, 135, 141, 148], -33",Element found at index 6,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 19 in the array [-92, -77, -75, -74, -34, -31, -30, -11, -7, 25, 32, 42, 43, 47, 52, 54, 55, 61, 65, 69, 70, 78, 113, 143].","[-92, -77, -75, -74, -34, -31, -30, -11, -7, 25, 32, 42, 43, 47, 52, 54, 55, 61, 65, 69, 70, 78, 113, 143], 19",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -4 exists in [-100, -98, -95, -80, -63, -53, -52, -49, -43, -35, -31, -29, -20, -9, 2, 3, 9, 11, 58, 62, 65, 99, 115, 121, 133, 136, 139, 145].","[-100, -98, -95, -80, -63, -53, -52, -49, -43, -35, -31, -29, -20, -9, 2, 3, 9, 11, 58, 62, 65, 99, 115, 121, 133, 136, 139, 145], -4",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 93 appear in [-90, -88, -80, -77, -72, -68, -64, -58, -55, -33, -14, -13, -11, -10, -6, -5, 1, 3, 5, 7, 8, 10, 14, 18, 24, 25, 30, 36, 42, 44, 55, 58, 63, 73, 85, 94, 98, 103, 104, 109, 123, 126, 134, 137]? Use linear search to check.","[-90, -88, -80, -77, -72, -68, -64, -58, -55, -33, -14, -13, -11, -10, -6, -5, 1, 3, 5, 7, 8, 10, 14, 18, 24, 25, 30, 36, 42, 44, 55, 58, 63, 73, 85, 94, 98, 103, 104, 109, 123, 126, 134, 137], 93",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -50 exists in [-88, -83, -71, -64, -63, -60, -38, -33, -29, 9, 30, 46, 53, 60, 62, 65, 138].","[-88, -83, -71, -64, -63, -60, -38, -33, -29, 9, 30, 46, 53, 60, 62, 65, 138], -50",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -24 in the array [-72, -71, -60, -49, -41, -22, -20, 30, 37, 39, 78, 84, 85, 87, 107, 111, 117, 135].","[-72, -71, -60, -49, -41, -22, -20, 30, 37, 39, 78, 84, 85, 87, 107, 111, 117, 135], -24",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 18 exists in [-87, -66, -34, -6, 18, 52, 56, 79, 107, 120, 147].","[-87, -66, -34, -6, 18, 52, 56, 79, 107, 120, 147], 18",Element found at index 4,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 94 in the array [-100, -92, -91, -70, -67, -64, -63, -62, -60, -58, -56, -53, -52, -50, -48, -45, -43, -39, -13, -2, 4, 12, 18, 25, 28, 29, 33, 37, 56, 62, 63, 70, 82, 85, 87, 101, 102, 104, 106, 107, 109, 113, 136, 137, 143, 145, 147].","[-100, -92, -91, -70, -67, -64, -63, -62, -60, -58, -56, -53, -52, -50, -48, -45, -43, -39, -13, -2, 4, 12, 18, 25, 28, 29, 33, 37, 56, 62, 63, 70, 82, 85, 87, 101, 102, 104, 106, 107, 109, 113, 136, 137, 143, 145, 147], 94",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -9 in the list [-93, -77, -75, -62, -30, -5, 6, 7, 8, 34, 43, 45, 55, 66, 67, 78, 83, 84, 103, 137, 148].","[-93, -77, -75, -62, -30, -5, 6, 7, 8, 34, 43, 45, 55, 66, 67, 78, 83, 84, 103, 137, 148], -9",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 89 in the list [-76, -73, -62, -51, -49, -45, -42, -41, -37, -31, -30, -6, 1, 2, 7, 24, 30, 35, 36, 58, 59, 81, 88, 91, 124].","[-76, -73, -62, -51, -49, -45, -42, -41, -37, -31, -30, -6, 1, 2, 7, 24, 30, 35, 36, 58, 59, 81, 88, 91, 124], 89",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -7 in the array [-78, -75, -68, -26, 4, 52, 78, 85, 90, 111, 131, 138].","[-78, -75, -68, -26, 4, 52, 78, 85, 90, 111, 131, 138], -7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 59 appear in [-77, -58, -52, -49, -44, -37, -27, -3, 7, 29, 33, 34, 41, 53, 54, 56, 86, 96, 99, 109, 114, 126, 131, 134, 145, 146]? Use linear search to check.","[-77, -58, -52, -49, -44, -37, -27, -3, 7, 29, 33, 34, 41, 53, 54, 56, 86, 96, 99, 109, 114, 126, 131, 134, 145, 146], 59",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 87 in the following list: [-99, -89, -78, -76, -60, -48, -41, -40, -34, -31, -11, 25, 52, 62, 112, 128, 133, 135].","[-99, -89, -78, -76, -60, -48, -41, -40, -34, -31, -11, 25, 52, 62, 112, 128, 133, 135], 87",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 59 in the following list: [-84, -72, -54, -13, -5, 42, 61, 67, 90, 132].","[-84, -72, -54, -13, -5, 42, 61, 67, 90, 132], 59",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 16 exists in [-99, -92, -85, -83, -77, -62, -54, -37, -34, -32, -28, 1, 8, 19, 28, 39, 42, 56, 60, 75, 89, 112, 128, 136, 146].","[-99, -92, -85, -83, -77, -62, -54, -37, -34, -32, -28, 1, 8, 19, 28, 39, 42, 56, 60, 75, 89, 112, 128, 136, 146], 16",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 68 in the list [-29, -23, 24, 30, 44, 85, 144, 148].","[-29, -23, 24, 30, 44, 85, 144, 148], 68",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 61 in the array [-95, -93, -92, -86, -73, -65, -61, -46, -39, -36, -21, -20, -16, -9, -5, 19, 28, 32, 34, 36, 38, 41, 48, 60, 63, 66, 67, 69, 70, 73, 82, 91, 96, 106, 121, 125, 126, 129, 132, 136, 141].","[-95, -93, -92, -86, -73, -65, -61, -46, -39, -36, -21, -20, -16, -9, -5, 19, 28, 32, 34, 36, 38, 41, 48, 60, 63, 66, 67, 69, 70, 73, 82, 91, 96, 106, 121, 125, 126, 129, 132, 136, 141], 61",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 97 in the list [-100, -99, -69, -42, -39, -25, -22, 3, 32, 72, 85, 135].","[-100, -99, -69, -42, -39, -25, -22, 3, 32, 72, 85, 135], 97",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -15 in the array [-86, -79, -50, 2, 8, 20, 70, 88, 119, 129].","[-86, -79, -50, 2, 8, 20, 70, 88, 119, 129], -15",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -8 in the following list: [-86, -72, -46, -25, -13, -11, -2, -1, 0, 8, 19, 45, 46, 67, 83, 121, 126, 132, 143, 146].","[-86, -72, -46, -25, -13, -11, -2, -1, 0, 8, 19, 45, 46, 67, 83, 121, 126, 132, 143, 146], -8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 71 in the following list: [-100, -95, -85, -81, -77, -70, -69, -42, -40, -23, -22, -17, -10, -4, 1, 6, 7, 13, 19, 20, 27, 34, 35, 36, 37, 56, 57, 63, 73, 79, 89, 91, 95, 96, 100, 103, 106, 109, 114, 115, 129, 131, 133, 135, 136, 139, 148].","[-100, -95, -85, -81, -77, -70, -69, -42, -40, -23, -22, -17, -10, -4, 1, 6, 7, 13, 19, 20, 27, 34, 35, 36, 37, 56, 57, 63, 73, 79, 89, 91, 95, 96, 100, 103, 106, 109, 114, 115, 129, 131, 133, 135, 136, 139, 148], 71",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -30 exists in [-51, -40, -29, 3, 15, 58, 81].","[-51, -40, -29, 3, 15, 58, 81], -30",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 37 exists in [-33, -6, 87, 120, 135].","[-33, -6, 87, 120, 135], 37",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 71 in the array [-99, -98, -95, -90, -89, -88, -85, -84, -79, -73, -57, -46, -44, -43, -34, -33, -26, -24, -11, -9, -8, -6, -5, 8, 10, 13, 18, 20, 39, 49, 53, 56, 57, 72, 89, 93, 99, 103, 107, 109, 117, 122, 127, 132, 140, 141, 148].","[-99, -98, -95, -90, -89, -88, -85, -84, -79, -73, -57, -46, -44, -43, -34, -33, -26, -24, -11, -9, -8, -6, -5, 8, 10, 13, 18, 20, 39, 49, 53, 56, 57, 72, 89, 93, 99, 103, 107, 109, 117, 122, 127, 132, 140, 141, 148], 71",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 84 in the following list: [-91, -84, -82, -79, -76, -50, -49, -46, -44, -41, -39, -37, -30, -25, -24, -15, -6, -2, -1, 16, 21, 26, 27, 36, 42, 47, 50, 56, 70, 79, 88, 95, 102, 108, 124, 127, 130, 149].","[-91, -84, -82, -79, -76, -50, -49, -46, -44, -41, -39, -37, -30, -25, -24, -15, -6, -2, -1, 16, 21, 26, 27, 36, 42, 47, 50, 56, 70, 79, 88, 95, 102, 108, 124, 127, 130, 149], 84",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 3 exists in [-6, 19, 45, 46, 70, 88, 95, 99, 133, 134].","[-6, 19, 45, 46, 70, 88, 95, 99, 133, 134], 3",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 34 in the following list: [-99, -93, -91, -90, -75, -61, -55, -50, -49, -20, -17, -13, -3, 4, 21, 22, 23, 37, 44, 45, 48, 51, 60, 63, 77, 80, 99, 105, 110, 124, 127, 128, 143].","[-99, -93, -91, -90, -75, -61, -55, -50, -49, -20, -17, -13, -3, 4, 21, 22, 23, 37, 44, 45, 48, 51, 60, 63, 77, 80, 99, 105, 110, 124, 127, 128, 143], 34",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 58 in the array [-56, -44, -28, -26, -3, 20, 54, 66, 85, 86, 93, 109, 111, 120, 131, 149].","[-56, -44, -28, -26, -3, 20, 54, 66, 85, 86, 93, 109, 111, 120, 131, 149], 58",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -8 in the list [-81, -63, 13, 21, 26, 56, 90, 99].","[-81, -63, 13, 21, 26, 56, 90, 99], -8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 22 in the following list: [-100, -98, -96, -94, -82, -77, -67, -50, -49, -40, -36, -30, -24, -22, -19, -13, -7, 5, 6, 11, 25, 30, 32, 35, 39, 42, 46, 50, 60, 66, 69, 82, 88, 89, 96, 98, 103, 123, 125, 131, 148].","[-100, -98, -96, -94, -82, -77, -67, -50, -49, -40, -36, -30, -24, -22, -19, -13, -7, 5, 6, 11, 25, 30, 32, 35, 39, 42, 46, 50, 60, 66, 69, 82, 88, 89, 96, 98, 103, 123, 125, 131, 148], 22",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -7 in the following list: [-98, -55, -45, -35, -31, 6, 42, 52, 83, 88, 95, 109, 119, 126, 127, 129, 133, 137].","[-98, -55, -45, -35, -31, 6, 42, 52, 83, 88, 95, 109, 119, 126, 127, 129, 133, 137], -7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 79 appear in [-100, -56, -53, 4, 34, 125]? Use linear search to check.","[-100, -56, -53, 4, 34, 125], 79",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 75 in the list [-76, -16, 20, 24, 30, 48, 56, 64, 110, 132, 138].","[-76, -16, 20, 24, 30, 48, 56, 64, 110, 132, 138], 75",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 83 in the list [-77, -50, -48, -16, -4, 8, 16, 51, 63, 65, 88, 98, 120].","[-77, -50, -48, -16, -4, 8, 16, 51, 63, 65, 88, 98, 120], 83",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 86 in the list [-89, -44, -27, -10, 35, 47, 68, 97, 111, 137, 146].","[-89, -44, -27, -10, 35, 47, 68, 97, 111, 137, 146], 86",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -29 in the array [-82, -78, -76, -72, -65, -64, -52, -50, -49, -29, -18, -9, -8, 2, 4, 20, 22, 30, 35, 38, 39, 46, 51, 53, 54, 58, 65, 67, 75, 86, 98, 109, 124, 134, 135].","[-82, -78, -76, -72, -65, -64, -52, -50, -49, -29, -18, -9, -8, 2, 4, 20, 22, 30, 35, 38, 39, 46, 51, 53, 54, 58, 65, 67, 75, 86, 98, 109, 124, 134, 135], -29",Element found at index 9,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -35 in the list [-83, -80, -58, -39, -17, -16, 5, 14, 39, 58, 74, 81, 85, 101, 104, 108, 115, 127].","[-83, -80, -58, -39, -17, -16, 5, 14, 39, 58, 74, 81, 85, 101, 104, 108, 115, 127], -35",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -12 in the list [-98, -97, -89, -81, -73, -68, -67, -64, -55, -54, -44, -43, -29, -19, -18, -14, 5, 8, 25, 26, 28, 33, 34, 41, 45, 50, 55, 57, 66, 69, 70, 71, 73, 76, 80, 86, 87, 88, 89, 101, 104, 105, 113, 118, 139, 142, 146, 148].","[-98, -97, -89, -81, -73, -68, -67, -64, -55, -54, -44, -43, -29, -19, -18, -14, 5, 8, 25, 26, 28, 33, 34, 41, 45, 50, 55, 57, 66, 69, 70, 71, 73, 76, 80, 86, 87, 88, 89, 101, 104, 105, 113, 118, 139, 142, 146, 148], -12",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -9 in the array [-89, -72, -55, -38, -33, -21, -9, -4, 32, 43, 44, 61, 65, 76, 98, 131, 143, 144, 145, 146].","[-89, -72, -55, -38, -33, -21, -9, -4, 32, 43, 44, 61, 65, 76, 98, 131, 143, 144, 145, 146], -9",Element found at index 6,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 93 appear in [-92, -61, 19, 35, 37, 64, 106, 123]? Use linear search to check.","[-92, -61, 19, 35, 37, 64, 106, 123], 93",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 34 in the list [-99, -98, -96, -94, -85, -80, -78, -73, -65, -46, -37, -28, -25, -24, -12, -4, 3, 14, 29, 46, 48, 73, 86, 94, 115].","[-99, -98, -96, -94, -85, -80, -78, -73, -65, -46, -37, -28, -25, -24, -12, -4, 3, 14, 29, 46, 48, 73, 86, 94, 115], 34",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 38 appear in [-100, -87, -83, -80, -73, -40, -35, -15, 4, 7, 14, 19, 30, 33, 36, 40, 53, 63, 70, 75, 96, 115, 123, 126, 144, 145]? Use linear search to check.","[-100, -87, -83, -80, -73, -40, -35, -15, 4, 7, 14, 19, 30, 33, 36, 40, 53, 63, 70, 75, 96, 115, 123, 126, 144, 145], 38",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 45 in the array [-96, -79, -62, -60, -57, -55, -42, -40, -20, -1, 6, 12, 14, 22, 28, 34, 35, 36, 38, 39, 46, 52, 65, 80, 82, 93, 96, 98, 101, 108, 120, 124, 127, 139, 142, 144, 147].","[-96, -79, -62, -60, -57, -55, -42, -40, -20, -1, 6, 12, 14, 22, 28, 34, 35, 36, 38, 39, 46, 52, 65, 80, 82, 93, 96, 98, 101, 108, 120, 124, 127, 139, 142, 144, 147], 45",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -44 appear in [-89, -62, -51, -46, -19, -18, -14, -5, 12, 26, 37, 55, 95, 108, 115]? Use linear search to check.","[-89, -62, -51, -46, -19, -18, -14, -5, 12, 26, 37, 55, 95, 108, 115], -44",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 84 in the array [-97, -92, -83, -77, -64, -53, -46, -3, 0, 2, 3, 4, 7, 9, 10, 36, 39, 43, 53, 64, 69, 70, 73, 77, 85, 86, 91, 95, 118, 121, 127, 128, 129, 132, 139, 147, 149].","[-97, -92, -83, -77, -64, -53, -46, -3, 0, 2, 3, 4, 7, 9, 10, 36, 39, 43, 53, 64, 69, 70, 73, 77, 85, 86, 91, 95, 118, 121, 127, 128, 129, 132, 139, 147, 149], 84",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 92 in the array [-91, -80, -73, -72, -61, -56, -54, -52, -49, -44, -42, -38, -29, -22, -14, -13, -8, -1, 3, 8, 9, 12, 15, 19, 24, 26, 34, 47, 55, 58, 60, 81, 88, 93, 101, 125, 128, 129, 139, 143, 148].","[-91, -80, -73, -72, -61, -56, -54, -52, -49, -44, -42, -38, -29, -22, -14, -13, -8, -1, 3, 8, 9, 12, 15, 19, 24, 26, 34, 47, 55, 58, 60, 81, 88, 93, 101, 125, 128, 129, 139, 143, 148], 92",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -17 in the following list: [-78, -62, -52, -40, -34, -23, -21, 8, 34, 106, 107].","[-78, -62, -52, -40, -34, -23, -21, 8, 34, 106, 107], -17",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -15 in the list [-97, -80, -76, -72, -67, -61, -60, -58, -54, -51, -50, -35, -31, -30, -28, 16, 18, 21, 24, 28, 33, 35, 36, 40, 41, 43, 44, 53, 60, 66, 73, 75, 77, 81, 91, 104, 108, 109, 112, 115, 117, 124].","[-97, -80, -76, -72, -67, -61, -60, -58, -54, -51, -50, -35, -31, -30, -28, 16, 18, 21, 24, 28, 33, 35, 36, 40, 41, 43, 44, 53, 60, 66, 73, 75, 77, 81, 91, 104, 108, 109, 112, 115, 117, 124], -15",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 74 in the list [-91, -87, -71, -66, -65, -64, -62, -50, -48, -41, -38, -31, -30, -27, -25, -24, -22, -21, -16, -10, -5, 3, 6, 10, 16, 19, 27, 33, 42, 44, 57, 61, 82, 86, 96, 99, 111, 129, 133, 134, 143, 146, 147, 149].","[-91, -87, -71, -66, -65, -64, -62, -50, -48, -41, -38, -31, -30, -27, -25, -24, -22, -21, -16, -10, -5, 3, 6, 10, 16, 19, 27, 33, 42, 44, 57, 61, 82, 86, 96, 99, 111, 129, 133, 134, 143, 146, 147, 149], 74",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -10 in the array [-94, -86, -81, -72, -67, -65, -62, -57, -45, -42, -39, -22, -20, -15, -7, -4, -3, 2, 7, 11, 14, 20, 23, 25, 38, 44, 52, 56, 58, 59, 61, 67, 69, 92, 94, 104, 123, 126, 131].","[-94, -86, -81, -72, -67, -65, -62, -57, -45, -42, -39, -22, -20, -15, -7, -4, -3, 2, 7, 11, 14, 20, 23, 25, 38, 44, 52, 56, 58, 59, 61, 67, 69, 92, 94, 104, 123, 126, 131], -10",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 15 in the list [-99, -82, -67, -48, -45, -39, -37, -33, -10, -4, 2, 5, 9, 14, 17, 23, 38, 50, 58, 59, 60, 61, 64, 69, 79, 81, 82, 85, 88, 89, 93, 104, 106, 110, 117, 143, 144].","[-99, -82, -67, -48, -45, -39, -37, -33, -10, -4, 2, 5, 9, 14, 17, 23, 38, 50, 58, 59, 60, 61, 64, 69, 79, 81, 82, 85, 88, 89, 93, 104, 106, 110, 117, 143, 144], 15",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -31 exists in [-94, -85, -79, -76, -75, -55, -50, -49, -46, -40, -38, -31, -20, -19, -17, -16, -13, -2, 3, 6, 10, 15, 18, 27, 33, 39, 51, 56, 57, 59, 63, 78, 84, 92, 94, 96, 120, 121, 139, 143, 147].","[-94, -85, -79, -76, -75, -55, -50, -49, -46, -40, -38, -31, -20, -19, -17, -16, -13, -2, 3, 6, 10, 15, 18, 27, 33, 39, 51, 56, 57, 59, 63, 78, 84, 92, 94, 96, 120, 121, 139, 143, 147], -31",Element found at index 11,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 41 exists in [-100, -86, -82, -79, -73, -69, -67, -62, -42, -12, -3, -2, -1, 5, 8, 15, 23, 32, 35, 42, 43, 45, 70, 72, 73, 77, 83, 87, 90, 93, 98, 105, 112, 115, 116, 119, 125, 146].","[-100, -86, -82, -79, -73, -69, -67, -62, -42, -12, -3, -2, -1, 5, 8, 15, 23, 32, 35, 42, 43, 45, 70, 72, 73, 77, 83, 87, 90, 93, 98, 105, 112, 115, 116, 119, 125, 146], 41",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 87 in the array [-98, -75, -73, -72, -68, -64, -26, -16, 2, 4, 48, 64, 71, 79, 86, 92, 117, 122, 123, 142, 147].","[-98, -75, -73, -72, -68, -64, -26, -16, 2, 4, 48, 64, 71, 79, 86, 92, 117, 122, 123, 142, 147], 87",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -26 in the array [-97, -96, -90, -85, -82, -77, -74, -73, -68, -63, -56, -29, -25, -22, -21, -8, 30, 36, 37, 45, 51, 65, 68, 71, 76, 90, 98, 102, 112, 119, 122, 130, 141].","[-97, -96, -90, -85, -82, -77, -74, -73, -68, -63, -56, -29, -25, -22, -21, -8, 30, 36, 37, 45, 51, 65, 68, 71, 76, 90, 98, 102, 112, 119, 122, 130, 141], -26",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 37 in the list [-95, -54, 21, 69, 96, 104].","[-95, -54, 21, 69, 96, 104], 37",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 90 exists in [-95, -82, -79, -77, -72, -64, -59, -55, -51, -46, -45, -44, -35, -34, -21, -15, -7, -1, 0, 3, 7, 8, 11, 14, 16, 20, 24, 35, 36, 38, 42, 44, 45, 47, 50, 52, 70, 71, 75, 76, 80, 81, 89, 115, 120, 127, 128, 139].","[-95, -82, -79, -77, -72, -64, -59, -55, -51, -46, -45, -44, -35, -34, -21, -15, -7, -1, 0, 3, 7, 8, 11, 14, 16, 20, 24, 35, 36, 38, 42, 44, 45, 47, 50, 52, 70, 71, 75, 76, 80, 81, 89, 115, 120, 127, 128, 139], 90",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 86 appear in [-93, -91, -89, -82, -74, -69, -66, -64, -37, -33, -30, -28, -12, 0, 1, 8, 33, 35, 37, 39, 42, 52, 58, 72, 83, 97, 100, 109, 111, 144]? Use linear search to check.","[-93, -91, -89, -82, -74, -69, -66, -64, -37, -33, -30, -28, -12, 0, 1, 8, 33, 35, 37, 39, 42, 52, 58, 72, 83, 97, 100, 109, 111, 144], 86",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 91 in the array [-98, -94, -70, -57, -53, -52, -43, -37, -35, -29, -27, -9, 18, 23, 31, 47, 53, 84, 91, 102, 105, 112, 123, 131, 144, 148].","[-98, -94, -70, -57, -53, -52, -43, -37, -35, -29, -27, -9, 18, 23, 31, 47, 53, 84, 91, 102, 105, 112, 123, 131, 144, 148], 91",Element found at index 18,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 85 in the following list: [-95, -90, -89, -78, -72, -52, -49, -43, -37, -35, -30, -29, -23, -6, -5, -3, 0, 1, 2, 6, 10, 16, 27, 28, 31, 32, 36, 53, 55, 108, 111, 122, 130, 140, 148].","[-95, -90, -89, -78, -72, -52, -49, -43, -37, -35, -30, -29, -23, -6, -5, -3, 0, 1, 2, 6, 10, 16, 27, 28, 31, 32, 36, 53, 55, 108, 111, 122, 130, 140, 148], 85",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -28 in the array [-93, -90, -83, -79, -75, -74, -72, -70, -69, -58, -42, -40, -27, -17, -6, -4, -2, 0, 4, 7, 11, 12, 14, 16, 20, 26, 40, 46, 50, 51, 56, 59, 62, 75, 83, 84, 92, 93, 96, 97, 106, 118, 120, 121, 126, 128, 137, 140, 144].","[-93, -90, -83, -79, -75, -74, -72, -70, -69, -58, -42, -40, -27, -17, -6, -4, -2, 0, 4, 7, 11, 12, 14, 16, 20, 26, 40, 46, 50, 51, 56, 59, 62, 75, 83, 84, 92, 93, 96, 97, 106, 118, 120, 121, 126, 128, 137, 140, 144], -28",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 38 exists in [-64, -45, -27, -13, 10, 19, 68, 73, 82, 111].","[-64, -45, -27, -13, 10, 19, 68, 73, 82, 111], 38",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 69 in the list [-85, -83, -81, -74, -71, -61, -59, -46, -45, -42, -33, -32, -29, -25, -18, -16, -11, -10, -9, -7, -6, -1, 0, 12, 41, 42, 44, 61, 72, 77, 78, 85, 88, 92, 100, 104, 116, 120, 142, 147].","[-85, -83, -81, -74, -71, -61, -59, -46, -45, -42, -33, -32, -29, -25, -18, -16, -11, -10, -9, -7, -6, -1, 0, 12, 41, 42, 44, 61, 72, 77, 78, 85, 88, 92, 100, 104, 116, 120, 142, 147], 69",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 37 in the array [-95, -81, -56, -55, -41, -38, -25, -22, -18, -2, 6, 16, 21, 24, 44, 54, 56, 62, 65, 66, 93, 96, 105, 108, 109, 116, 131, 138, 144].","[-95, -81, -56, -55, -41, -38, -25, -22, -18, -2, 6, 16, 21, 24, 44, 54, 56, 62, 65, 66, 93, 96, 105, 108, 109, 116, 131, 138, 144], 37",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 73 in the list [-95, -92, -88, -78, -67, -62, -50, -45, -44, -43, -19, -18, -14, -12, -3, 23, 32, 33, 44, 45, 50, 52, 54, 55, 59, 68, 73, 74, 79, 88, 104, 128].","[-95, -92, -88, -78, -67, -62, -50, -45, -44, -43, -19, -18, -14, -12, -3, 23, 32, 33, 44, 45, 50, 52, 54, 55, 59, 68, 73, 74, 79, 88, 104, 128], 73",Element found at index 26,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 49 appear in [-92, -84, -81, -71, -61, -59, -39, -31, -29, -26, -25, -22, -20, -19, 17, 24, 32, 34, 40, 45, 59, 66, 70, 74, 81, 85, 90, 93, 94, 97, 99, 117, 122, 138]? Use linear search to check.","[-92, -84, -81, -71, -61, -59, -39, -31, -29, -26, -25, -22, -20, -19, 17, 24, 32, 34, 40, 45, 59, 66, 70, 74, 81, 85, 90, 93, 94, 97, 99, 117, 122, 138], 49",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 95 in the following list: [-93, -89, -80, -64, -49, -47, -29, -8, -7, 2, 3, 11, 14, 16, 31, 32, 55, 78, 83, 99, 100, 127, 131, 135, 148].","[-93, -89, -80, -64, -49, -47, -29, -8, -7, 2, 3, 11, 14, 16, 31, 32, 55, 78, 83, 99, 100, 127, 131, 135, 148], 95",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 17 in the following list: [-97, -96, -93, -90, -82, -79, -78, -69, -68, -57, -47, -44, -33, -32, -30, -25, -21, -17, -15, -14, -8, -6, -4, -2, -1, 1, 5, 25, 27, 28, 32, 55, 63, 71, 72, 73, 74, 79, 81, 82, 107, 113, 122, 129, 136, 149].","[-97, -96, -93, -90, -82, -79, -78, -69, -68, -57, -47, -44, -33, -32, -30, -25, -21, -17, -15, -14, -8, -6, -4, -2, -1, 1, 5, 25, 27, 28, 32, 55, 63, 71, 72, 73, 74, 79, 81, 82, 107, 113, 122, 129, 136, 149], 17",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -46 exists in [-98, -96, -95, -94, -86, -83, -77, -68, -66, -63, -58, -57, -45, -35, -31, -14, -9, -4, -3, 0, 1, 3, 5, 24, 27, 33, 38, 42, 44, 57, 72, 76, 77, 78, 79, 82, 84, 86, 89, 99, 107, 109, 112, 120, 129, 137, 147, 148].","[-98, -96, -95, -94, -86, -83, -77, -68, -66, -63, -58, -57, -45, -35, -31, -14, -9, -4, -3, 0, 1, 3, 5, 24, 27, 33, 38, 42, 44, 57, 72, 76, 77, 78, 79, 82, 84, 86, 89, 99, 107, 109, 112, 120, 129, 137, 147, 148], -46",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 40 exists in [-98, -85, -83, -52, -51, -43, -14, -6, 6, 9, 45, 49, 56, 74, 108, 115, 137, 138, 148].","[-98, -85, -83, -52, -51, -43, -14, -6, 6, 9, 45, 49, 56, 74, 108, 115, 137, 138, 148], 40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 6 in the following list: [-96, -88, -81, -66, -58, -51, -45, -32, -31, -26, -21, 2, 14, 15, 22, 24, 27, 32, 34, 38, 39, 58, 62, 64, 73, 78, 79, 90, 104, 111, 112, 115, 116, 118, 123, 126, 129, 134, 140].","[-96, -88, -81, -66, -58, -51, -45, -32, -31, -26, -21, 2, 14, 15, 22, 24, 27, 32, 34, 38, 39, 58, 62, 64, 73, 78, 79, 90, 104, 111, 112, 115, 116, 118, 123, 126, 129, 134, 140], 6",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -9 in the following list: [-73, 55, 57, 96, 112].","[-73, 55, 57, 96, 112], -9",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 20 exists in [-98, -83, -80, -76, -70, -66, -50, -39, -31, -29, -18, -12, 4, 6, 11, 12, 23, 27, 29, 43, 49, 58, 60, 62, 66, 67, 69, 70, 79, 82, 94, 102, 106, 110, 113, 115, 120, 129, 132, 133, 134, 136, 137, 138, 141, 142, 143, 145, 146, 148].","[-98, -83, -80, -76, -70, -66, -50, -39, -31, -29, -18, -12, 4, 6, 11, 12, 23, 27, 29, 43, 49, 58, 60, 62, 66, 67, 69, 70, 79, 82, 94, 102, 106, 110, 113, 115, 120, 129, 132, 133, 134, 136, 137, 138, 141, 142, 143, 145, 146, 148], 20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 28 exists in [-99, -96, -89, -71, -70, -66, -49, -24, -13, -9, 1, 17, 22, 35, 39, 66, 73, 83, 88, 95, 96, 100, 112, 115, 117, 120, 126, 132, 135].","[-99, -96, -89, -71, -70, -66, -49, -24, -13, -9, 1, 17, 22, 35, 39, 66, 73, 83, 88, 95, 96, 100, 112, 115, 117, 120, 126, 132, 135], 28",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -43 exists in [-99, -97, -96, -77, -76, -72, -64, -59, -57, -43, -41, -40, -30, -16, -15, -8, -2, 1, 4, 8, 9, 15, 19, 20, 23, 29, 31, 47, 48, 49, 50, 51, 60, 62, 63, 76, 78, 86, 87, 91, 94, 95, 102, 106, 108, 117, 123, 135, 144].","[-99, -97, -96, -77, -76, -72, -64, -59, -57, -43, -41, -40, -30, -16, -15, -8, -2, 1, 4, 8, 9, 15, 19, 20, 23, 29, 31, 47, 48, 49, 50, 51, 60, 62, 63, 76, 78, 86, 87, 91, 94, 95, 102, 106, 108, 117, 123, 135, 144], -43",Element found at index 9,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 87 exists in [-98, -94, -90, -89, -88, -77, -76, -74, -66, -48, -47, -44, -41, -33, -31, -30, -9, -7, -3, -1, 1, 7, 16, 23, 26, 30, 37, 38, 40, 41, 42, 43, 45, 48, 60, 62, 67, 89, 91, 97, 107, 119, 124, 132, 134, 137, 143].","[-98, -94, -90, -89, -88, -77, -76, -74, -66, -48, -47, -44, -41, -33, -31, -30, -9, -7, -3, -1, 1, 7, 16, 23, 26, 30, 37, 38, 40, 41, 42, 43, 45, 48, 60, 62, 67, 89, 91, 97, 107, 119, 124, 132, 134, 137, 143], 87",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 68 exists in [-94, -89, -80, -72, -65, -40, -33, -7, -6, 3, 4, 8, 48, 49, 64, 98, 131, 139, 140, 146].","[-94, -89, -80, -72, -65, -40, -33, -7, -6, 3, 4, 8, 48, 49, 64, 98, 131, 139, 140, 146], 68",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 70 exists in [-100, -98, -85, -84, -80, -78, -68, -65, -53, -47, -34, -23, -22, -15, -13, -2, 1, 7, 9, 19, 20, 27, 29, 34, 40, 46, 50, 58, 68, 69, 72, 79, 83, 84, 85, 89, 99, 101, 112, 116, 127, 139, 140, 144].","[-100, -98, -85, -84, -80, -78, -68, -65, -53, -47, -34, -23, -22, -15, -13, -2, 1, 7, 9, 19, 20, 27, 29, 34, 40, 46, 50, 58, 68, 69, 72, 79, 83, 84, 85, 89, 99, 101, 112, 116, 127, 139, 140, 144], 70",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 37 in the following list: [-74, -72, -71, -69, -65, -64, -47, -46, -42, -41, -38, -32, -31, -25, -22, -10, 7, 21, 26, 30, 33, 38, 40, 48, 51, 52, 59, 61, 63, 88, 89, 92, 94, 95, 96, 102, 105, 110, 116, 118, 119, 123, 129, 130, 137, 141].","[-74, -72, -71, -69, -65, -64, -47, -46, -42, -41, -38, -32, -31, -25, -22, -10, 7, 21, 26, 30, 33, 38, 40, 48, 51, 52, 59, 61, 63, 88, 89, 92, 94, 95, 96, 102, 105, 110, 116, 118, 119, 123, 129, 130, 137, 141], 37",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 66 appear in [-57, -52, -35, -5, 42, 77, 80, 93, 97, 149]? Use linear search to check.","[-57, -52, -35, -5, 42, 77, 80, 93, 97, 149], 66",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 23 in the array [-95, -92, -90, -82, -60, -59, -40, -39, -23, -21, -17, -14, -6, -5, 1, 3, 4, 13, 15, 21, 24, 29, 40, 46, 47, 55, 60, 61, 63, 67, 82, 89, 90, 92, 93, 96, 98, 99, 107, 109, 115, 117, 119, 120, 121, 127, 129, 130, 145].","[-95, -92, -90, -82, -60, -59, -40, -39, -23, -21, -17, -14, -6, -5, 1, 3, 4, 13, 15, 21, 24, 29, 40, 46, 47, 55, 60, 61, 63, 67, 82, 89, 90, 92, 93, 96, 98, 99, 107, 109, 115, 117, 119, 120, 121, 127, 129, 130, 145], 23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -28 in the following list: [-97, -96, -95, -93, -90, -87, -79, -76, -74, -73, -70, -69, -65, -58, -53, -42, -31, -19, -4, 4, 11, 18, 31, 42, 47, 50, 70, 76, 92, 95, 101, 103, 112, 123, 135, 146].","[-97, -96, -95, -93, -90, -87, -79, -76, -74, -73, -70, -69, -65, -58, -53, -42, -31, -19, -4, 4, 11, 18, 31, 42, 47, 50, 70, 76, 92, 95, 101, 103, 112, 123, 135, 146], -28",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 0 in the list [-93, -85, -81, -79, -76, -69, -56, -41, -24, 3, 20, 35, 37, 39, 50, 61, 64, 116, 139, 144].","[-93, -85, -81, -79, -76, -69, -56, -41, -24, 3, 20, 35, 37, 39, 50, 61, 64, 116, 139, 144], 0",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 51 in the list [-83, -30, -15, 72, 77, 132, 149].","[-83, -30, -15, 72, 77, 132, 149], 51",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 56 exists in [-100, -91, -89, -88, -84, -63, -61, -56, -53, -48, -42, -36, -35, -33, -19, -15, -2, 3, 10, 11, 27, 34, 36, 46, 47, 48, 59, 62, 65, 68, 72, 87, 108, 122, 130, 134, 139, 140, 145, 148, 149].","[-100, -91, -89, -88, -84, -63, -61, -56, -53, -48, -42, -36, -35, -33, -19, -15, -2, 3, 10, 11, 27, 34, 36, 46, 47, 48, 59, 62, 65, 68, 72, 87, 108, 122, 130, 134, 139, 140, 145, 148, 149], 56",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -25 in the following list: [-93, -91, -90, -79, -77, -65, -56, -53, -51, -44, -41, -25, -21, -19, -7, -1, 4, 8, 11, 12, 19, 21, 22, 25, 28, 30, 31, 32, 35, 37, 72, 80, 92, 100, 106, 108, 112, 113, 114, 118, 120, 135, 137, 139, 144].","[-93, -91, -90, -79, -77, -65, -56, -53, -51, -44, -41, -25, -21, -19, -7, -1, 4, 8, 11, 12, 19, 21, 22, 25, 28, 30, 31, 32, 35, 37, 72, 80, 92, 100, 106, 108, 112, 113, 114, 118, 120, 135, 137, 139, 144], -25",Element found at index 11,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 100 in the list [-100, -97, -92, -86, -84, -79, -73, -71, -60, -58, -55, -43, -38, -35, -21, -16, -12, -7, 2, 17, 19, 25, 26, 29, 38, 44, 48, 49, 65, 73, 78, 81, 83, 86, 89, 96, 98, 99, 110, 112, 115, 118, 127, 130, 131, 134, 138, 141].","[-100, -97, -92, -86, -84, -79, -73, -71, -60, -58, -55, -43, -38, -35, -21, -16, -12, -7, 2, 17, 19, 25, 26, 29, 38, 44, 48, 49, 65, 73, 78, 81, 83, 86, 89, 96, 98, 99, 110, 112, 115, 118, 127, 130, 131, 134, 138, 141], 100",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 91 in the list [-93, -91, -84, -78, -66, -64, -28, 2, 5, 12, 33, 42, 47, 51, 55, 60, 62, 98, 105, 106, 111, 136, 137, 140, 141, 147].","[-93, -91, -84, -78, -66, -64, -28, 2, 5, 12, 33, 42, 47, 51, 55, 60, 62, 98, 105, 106, 111, 136, 137, 140, 141, 147], 91",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 66 in the list [-90, 36, 99, 116, 146].","[-90, 36, 99, 116, 146], 66",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -6 exists in [-98, -95, -94, -81, -78, -76, -72, -68, -61, -58, -57, -50, -45, -44, -29, -28, -26, -23, -22, -19, -16, -14, -13, -10, -2, -1, 9, 14, 19, 28, 36, 46, 54, 56, 57, 58, 61, 77, 80, 94, 115, 123, 129, 132, 135, 142, 143, 149].","[-98, -95, -94, -81, -78, -76, -72, -68, -61, -58, -57, -50, -45, -44, -29, -28, -26, -23, -22, -19, -16, -14, -13, -10, -2, -1, 9, 14, 19, 28, 36, 46, 54, 56, 57, 58, 61, 77, 80, 94, 115, 123, 129, 132, 135, 142, 143, 149], -6",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -33 in the array [-100, -97, -80, -67, -63, -54, -44, -40, -34, -31, -29, -24, -18, -14, -9, 23, 25, 32, 41, 45, 47, 118, 126].","[-100, -97, -80, -67, -63, -54, -44, -40, -34, -31, -29, -24, -18, -14, -9, 23, 25, 32, 41, 45, 47, 118, 126], -33",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 61 in the following list: [-100, -94, 45, 87, 88, 95].","[-100, -94, 45, 87, 88, 95], 61",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -14 in the array [-92, -76, -71, -69, -66, -56, -53, -50, -44, -32, -22, -21, -13, -10, -8, 0, 8, 20, 22, 31, 35, 41, 45, 55, 73, 79, 97, 104, 114, 116, 129, 134].","[-92, -76, -71, -69, -66, -56, -53, -50, -44, -32, -22, -21, -13, -10, -8, 0, 8, 20, 22, 31, 35, 41, 45, 55, 73, 79, 97, 104, 114, 116, 129, 134], -14",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 48 exists in [-95, -94, -87, -80, -79, -78, -63, -51, -50, -48, -38, -26, -11, -2, 7, 8, 16, 35, 37, 41, 44, 45, 48, 53, 57, 68, 72, 77, 81, 94, 95, 101, 105, 110, 114, 117, 126, 127, 135, 146].","[-95, -94, -87, -80, -79, -78, -63, -51, -50, -48, -38, -26, -11, -2, 7, 8, 16, 35, 37, 41, 44, 45, 48, 53, 57, 68, 72, 77, 81, 94, 95, 101, 105, 110, 114, 117, 126, 127, 135, 146], 48",Element found at index 22,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -34 in the list [-96, -67, -22, 28, 84, 107, 108, 139, 149].","[-96, -67, -22, 28, 84, 107, 108, 139, 149], -34",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 27 in the following list: [-98, -97, -88, -81, -80, -60, -43, -12, -3, 21, 22, 24, 32, 47, 71, 82, 100, 104, 115, 128, 129, 130, 131, 132, 135].","[-98, -97, -88, -81, -80, -60, -43, -12, -3, 21, 22, 24, 32, 47, 71, 82, 100, 104, 115, 128, 129, 130, 131, 132, 135], 27",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 20 appear in [-94, -83, -82, -75, -51, -33, -24, -17, 15, 18, 63, 97, 104, 105, 115, 145]? Use linear search to check.","[-94, -83, -82, -75, -51, -33, -24, -17, 15, 18, 63, 97, 104, 105, 115, 145], 20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 42 in the following list: [-97, -96, -90, -85, -68, -65, -59, -55, -52, -49, -32, -31, -26, -24, -21, -20, -10, -3, 1, 3, 19, 25, 27, 36, 40, 43, 44, 53, 62, 72, 79, 81, 82, 84, 92, 94, 99, 103, 108, 112, 117, 118, 120, 121, 127, 147].","[-97, -96, -90, -85, -68, -65, -59, -55, -52, -49, -32, -31, -26, -24, -21, -20, -10, -3, 1, 3, 19, 25, 27, 36, 40, 43, 44, 53, 62, 72, 79, 81, 82, 84, 92, 94, 99, 103, 108, 112, 117, 118, 120, 121, 127, 147], 42",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 66 exists in [24, 49, 51, 104, 112].","[24, 49, 51, 104, 112], 66",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -33 in the array [-93, -90, -87, -71, -57, -51, -50, -33, -32, -29, -23, -22, -11, 0, 6, 11, 17, 26, 30, 37, 39, 42, 44, 50, 52, 67, 77, 86, 87, 110, 113, 118, 122, 125, 144, 148].","[-93, -90, -87, -71, -57, -51, -50, -33, -32, -29, -23, -22, -11, 0, 6, 11, 17, 26, 30, 37, 39, 42, 44, 50, 52, 67, 77, 86, 87, 110, 113, 118, 122, 125, 144, 148], -33",Element found at index 7,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 48 appear in [-96, -90, -87, -80, -76, -74, -71, -67, -64, -63, -60, -59, -51, -50, -47, -43, -39, -34, -29, -27, -26, -19, -11, -10, -9, 7, 12, 15, 22, 23, 26, 31, 32, 46, 47, 76, 77, 87, 91, 98, 100, 116, 117, 118, 133, 137, 140, 141, 146, 149]? Use linear search to check.","[-96, -90, -87, -80, -76, -74, -71, -67, -64, -63, -60, -59, -51, -50, -47, -43, -39, -34, -29, -27, -26, -19, -11, -10, -9, 7, 12, 15, 22, 23, 26, 31, 32, 46, 47, 76, 77, 87, 91, 98, 100, 116, 117, 118, 133, 137, 140, 141, 146, 149], 48",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 4 exists in [-91, -88, -85, -70, -65, -41, -21, 0, 1, 5, 7, 19, 33, 48, 59, 62, 71, 74, 80, 84, 86, 113, 135, 147].","[-91, -88, -85, -70, -65, -41, -21, 0, 1, 5, 7, 19, 33, 48, 59, 62, 71, 74, 80, 84, 86, 113, 135, 147], 4",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -29 in the array [-71, -63, -44, -43, -39, -35, -22, -6, 24, 28, 41, 69, 88, 89, 90, 93, 97, 109, 122, 125].","[-71, -63, -44, -43, -39, -35, -22, -6, 24, 28, 41, 69, 88, 89, 90, 93, 97, 109, 122, 125], -29",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 7 in the following list: [-66, -36, -31, -27, -26, -24, -23, -7, 10, 30, 33, 52, 53, 54, 67, 75, 99, 118, 122, 142, 143, 144, 147].","[-66, -36, -31, -27, -26, -24, -23, -7, 10, 30, 33, 52, 53, 54, 67, 75, 99, 118, 122, 142, 143, 144, 147], 7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 96 exists in [-83, -71, -70, -62, -36, -32, -28, -16, 11, 18, 45, 53, 54, 63, 66, 81, 82, 83, 86, 99, 102, 104, 110, 113, 119, 130, 137, 138, 139, 142].","[-83, -71, -70, -62, -36, -32, -28, -16, 11, 18, 45, 53, 54, 63, 66, 81, 82, 83, 86, 99, 102, 104, 110, 113, 119, 130, 137, 138, 139, 142], 96",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 32 appear in [-100, -99, -98, -95, -92, -91, -88, -79, -54, -53, -42, -29, -24, -22, -3, 2, 6, 20, 25, 37, 40, 49, 57, 62, 64, 66, 89, 111, 121, 131]? Use linear search to check.","[-100, -99, -98, -95, -92, -91, -88, -79, -54, -53, -42, -29, -24, -22, -3, 2, 6, 20, 25, 37, 40, 49, 57, 62, 64, 66, 89, 111, 121, 131], 32",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -49 in the array [-97, -34, -6, 2, 14, 21, 57, 115, 123, 133, 141].","[-97, -34, -6, 2, 14, 21, 57, 115, 123, 133, 141], -49",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 83 exists in [-99, -98, -86, -80, -69, -48, -37, 30, 66, 80, 83, 104, 130, 148].","[-99, -98, -86, -80, -69, -48, -37, 30, 66, 80, 83, 104, 130, 148], 83",Element found at index 10,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -32 in the following list: [-96, -92, -89, -82, -76, -74, -71, -63, -59, -56, -52, -46, -43, -33, -15, -11, -7, 1, 3, 9, 11, 14, 16, 17, 27, 30, 33, 34, 35, 56, 60, 70, 74, 77, 81, 86, 105, 110, 116, 132, 143, 147].","[-96, -92, -89, -82, -76, -74, -71, -63, -59, -56, -52, -46, -43, -33, -15, -11, -7, 1, 3, 9, 11, 14, 16, 17, 27, 30, 33, 34, 35, 56, 60, 70, 74, 77, 81, 86, 105, 110, 116, 132, 143, 147], -32",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -41 in the array [-79, -68, -64, -62, -52, -46, -45, -43, -30, -27, -16, -9, 0, 17, 42, 45, 55, 65, 78, 85, 86, 111, 125].","[-79, -68, -64, -62, -52, -46, -45, -43, -30, -27, -16, -9, 0, 17, 42, 45, 55, 65, 78, 85, 86, 111, 125], -41",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 30 in the following list: [-94, -93, -88, -73, -65, -63, -60, -51, -49, -42, -36, -3, 8, 30, 34, 36, 41, 46, 68, 77, 80, 102, 104, 108, 120, 125, 127, 132, 139].","[-94, -93, -88, -73, -65, -63, -60, -51, -49, -42, -36, -3, 8, 30, 34, 36, 41, 46, 68, 77, 80, 102, 104, 108, 120, 125, 127, 132, 139], 30",Element found at index 13,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 14 appear in [-97, -91, -70, -69, -63, -62, -49, -44, -43, -41, -38, -36, -26, -16, -2, 4, 9, 18, 22, 23, 25, 27, 28, 30, 33, 42, 51, 59, 64, 76, 89, 92, 100, 102, 105, 106, 109, 113, 114, 120, 130, 132, 140, 143, 144, 145, 147, 148]? Use linear search to check.","[-97, -91, -70, -69, -63, -62, -49, -44, -43, -41, -38, -36, -26, -16, -2, 4, 9, 18, 22, 23, 25, 27, 28, 30, 33, 42, 51, 59, 64, 76, 89, 92, 100, 102, 105, 106, 109, 113, 114, 120, 130, 132, 140, 143, 144, 145, 147, 148], 14",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 52 in the array [-66, -59, -48, -44, -38, -25, -8, 7, 20, 29, 30, 33, 55, 60, 73, 77, 79, 81, 82, 109, 112, 124, 128, 136, 142].","[-66, -59, -48, -44, -38, -25, -8, 7, 20, 29, 30, 33, 55, 60, 73, 77, 79, 81, 82, 109, 112, 124, 128, 136, 142], 52",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -24 exists in [-95, -82, -81, -79, -78, -77, -61, -54, -46, -43, -20, -19, -3, 9, 11, 21, 30, 34, 36, 43, 48, 85, 87, 106, 113, 121, 129, 135, 139, 148].","[-95, -82, -81, -79, -78, -77, -61, -54, -46, -43, -20, -19, -3, 9, 11, 21, 30, 34, 36, 43, 48, 85, 87, 106, 113, 121, 129, 135, 139, 148], -24",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 18 exists in [-96, -89, -82, -81, -69, -64, -61, -57, -49, 2, 5, 12, 14, 22, 27, 33, 42, 47, 49, 52, 55, 63, 76, 78, 85, 91, 94, 101, 107, 108, 118, 121, 123, 127, 132, 133, 134, 140, 147, 148].","[-96, -89, -82, -81, -69, -64, -61, -57, -49, 2, 5, 12, 14, 22, 27, 33, 42, 47, 49, 52, 55, 63, 76, 78, 85, 91, 94, 101, 107, 108, 118, 121, 123, 127, 132, 133, 134, 140, 147, 148], 18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 92 exists in [-76, -58, -51, -40, -37, -32, -19, -11, -8, -1, 1, 16, 19, 21, 22, 43, 53, 57, 60, 74, 89, 98, 101, 109, 129, 137].","[-76, -58, -51, -40, -37, -32, -19, -11, -8, -1, 1, 16, 19, 21, 22, 43, 53, 57, 60, 74, 89, 98, 101, 109, 129, 137], 92",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 33 in the list [-77, -69, -68, -55, -12, 31, 59, 90, 146].","[-77, -69, -68, -55, -12, 31, 59, 90, 146], 33",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -44 in the following list: [-98, -95, -90, -74, -58, -30, 29, 35, 38, 51, 56, 62, 63, 68, 74, 85, 86, 88, 102, 114, 138, 140, 146].","[-98, -95, -90, -74, -58, -30, 29, 35, 38, 51, 56, 62, 63, 68, 74, 85, 86, 88, 102, 114, 138, 140, 146], -44",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -18 exists in [-96, -81, -66, -48, -42, -35, -12, 12, 34, 52, 63, 69, 109, 126, 131, 132, 137].","[-96, -81, -66, -48, -42, -35, -12, 12, 34, 52, 63, 69, 109, 126, 131, 132, 137], -18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 84 in the following list: [-96, -48, -40, -21, -13, -11, -10, -5, 0, 4, 6, 14, 17, 36, 42, 46, 58, 66, 67, 69, 70, 75, 77, 79, 82, 91, 93, 109, 111, 125, 128, 138, 143, 148].","[-96, -48, -40, -21, -13, -11, -10, -5, 0, 4, 6, 14, 17, 36, 42, 46, 58, 66, 67, 69, 70, 75, 77, 79, 82, 91, 93, 109, 111, 125, 128, 138, 143, 148], 84",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 90 in the list [-95, -87, -79, -71, -68, -59, -55, -42, -32, -30, -19, -17, -16, -9, -6, -1, 0, 6, 23, 28, 29, 31, 40, 44, 50, 55, 57, 58, 73, 76, 77, 82, 83, 86, 98, 107, 114, 116, 119, 126, 133, 140, 142, 144].","[-95, -87, -79, -71, -68, -59, -55, -42, -32, -30, -19, -17, -16, -9, -6, -1, 0, 6, 23, 28, 29, 31, 40, 44, 50, 55, 57, 58, 73, 76, 77, 82, 83, 86, 98, 107, 114, 116, 119, 126, 133, 140, 142, 144], 90",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 63 appear in [-88, -86, -85, -82, -66, -55, -53, -51, -48, -41, -39, -36, -32, -21, -4, 14, 18, 29, 47, 56, 75, 96, 106, 112, 114, 115, 134, 144]? Use linear search to check.","[-88, -86, -85, -82, -66, -55, -53, -51, -48, -41, -39, -36, -32, -21, -4, 14, 18, 29, 47, 56, 75, 96, 106, 112, 114, 115, 134, 144], 63",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 62 in the array [-80, -76, -59, -49, 92, 117, 128, 129, 131].","[-80, -76, -59, -49, 92, 117, 128, 129, 131], 62",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 61 in the array [-93, -86, -77, -64, -56, -55, -49, -35, -25, -9, 3, 4, 12, 15, 19, 22, 24, 25, 52, 54, 67, 70, 73, 92, 94, 99, 101, 113, 114, 120, 123, 126, 147, 148].","[-93, -86, -77, -64, -56, -55, -49, -35, -25, -9, 3, 4, 12, 15, 19, 22, 24, 25, 52, 54, 67, 70, 73, 92, 94, 99, 101, 113, 114, 120, 123, 126, 147, 148], 61",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 63 in the array [-78, -52, -42, -35, -20, 6, 8, 21, 34, 49, 51, 76, 77, 113].","[-78, -52, -42, -35, -20, 6, 8, 21, 34, 49, 51, 76, 77, 113], 63",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -25 in the following list: [-96, -82, -57, -25, -23, -1, 16, 18, 26, 29, 54, 66, 83, 89, 106, 126, 129, 132, 146].","[-96, -82, -57, -25, -23, -1, 16, 18, 26, 29, 54, 66, 83, 89, 106, 126, 129, 132, 146], -25",Element found at index 3,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -8 appear in [-86, -82, -74, -69, -51, -36, -35, -26, 1, 12, 13, 16, 18, 20, 45, 47, 51, 53, 75, 82, 85, 108, 115]? Use linear search to check.","[-86, -82, -74, -69, -51, -36, -35, -26, 1, 12, 13, 16, 18, 20, 45, 47, 51, 53, 75, 82, 85, 108, 115], -8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -34 appear in [-89, -87, -84, -45, -24, 10, 21, 57, 74, 136]? Use linear search to check.","[-89, -87, -84, -45, -24, 10, 21, 57, 74, 136], -34",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 72 appear in [-98, -97, -96, -77, -72, -70, -68, -67, -63, -48, -34, -22, -9, -6, 10, 17, 26, 29, 35, 41, 47, 60, 64, 65, 122, 126]? Use linear search to check.","[-98, -97, -96, -77, -72, -70, -68, -67, -63, -48, -34, -22, -9, -6, 10, 17, 26, 29, 35, 41, 47, 60, 64, 65, 122, 126], 72",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -8 in the array [-97, -84, -83, -81, -77, -72, -64, -62, -57, -49, -37, -36, -32, -28, -25, -24, -16, -7, 1, 9, 11, 12, 19, 22, 28, 33, 38, 49, 54, 60, 61, 65, 79, 89, 97, 98, 113, 118, 123, 130, 138, 141].","[-97, -84, -83, -81, -77, -72, -64, -62, -57, -49, -37, -36, -32, -28, -25, -24, -16, -7, 1, 9, 11, 12, 19, 22, 28, 33, 38, 49, 54, 60, 61, 65, 79, 89, 97, 98, 113, 118, 123, 130, 138, 141], -8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -9 in the following list: [-75, -58, -29, -24, -22, -15, -9, 25, 32, 41, 42, 54, 57, 125, 130].","[-75, -58, -29, -24, -22, -15, -9, 25, 32, 41, 42, 54, 57, 125, 130], -9",Element found at index 6,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -20 exists in [-90, -89, -88, -79, -76, -67, -65, -63, -46, -43, -9, -7, -1, 9, 16, 28, 30, 34, 40, 46, 52, 69, 70, 75, 83, 86, 87, 99, 101, 108, 109, 116, 126, 130, 135, 140, 147].","[-90, -89, -88, -79, -76, -67, -65, -63, -46, -43, -9, -7, -1, 9, 16, 28, 30, 34, 40, 46, 52, 69, 70, 75, 83, 86, 87, 99, 101, 108, 109, 116, 126, 130, 135, 140, 147], -20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 100 in the array [-94, -82, -78, -31, -24, 3, 53, 98, 116, 125, 132].","[-94, -82, -78, -31, -24, 3, 53, 98, 116, 125, 132], 100",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -44 exists in [-66, -8, 3, 12, 22, 33, 61, 104, 137].","[-66, -8, 3, 12, 22, 33, 61, 104, 137], -44",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -27 in the following list: [-85, -70, -69, -60, -53, -41, -38, -37, -34, -28, -19, -2, 13, 25, 26, 29, 35, 51, 54, 55, 68, 81, 84, 88, 112, 115, 137, 141, 147].","[-85, -70, -69, -60, -53, -41, -38, -37, -34, -28, -19, -2, 13, 25, 26, 29, 35, 51, 54, 55, 68, 81, 84, 88, 112, 115, 137, 141, 147], -27",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 13 exists in [-87, -85, -84, -69, -61, -50, -46, -37, -29, -15, -14, 16, 18, 23, 48, 60, 64, 69, 70, 89, 99, 100, 109, 116, 139].","[-87, -85, -84, -69, -61, -50, -46, -37, -29, -15, -14, 16, 18, 23, 48, 60, 64, 69, 70, 89, 99, 100, 109, 116, 139], 13",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 42 in the list [-70, -11, 10, 22, 48, 91, 93, 94, 117, 134].","[-70, -11, 10, 22, 48, 91, 93, 94, 117, 134], 42",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 26 in the following list: [-94, -89, -85, -82, -73, -53, -32, -28, -27, -21, -16, -11, -10, -9, -8, 1, 4, 23, 31, 57, 66, 75, 86, 93, 100, 123, 135, 138, 149].","[-94, -89, -85, -82, -73, -53, -32, -28, -27, -21, -16, -11, -10, -9, -8, 1, 4, 23, 31, 57, 66, 75, 86, 93, 100, 123, 135, 138, 149], 26",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -7 in the array [-96, -95, -93, -91, -89, -68, -64, -63, -57, -49, -40, -8, 3, 16, 18, 65, 75, 76, 88, 104, 122, 124, 128, 144].","[-96, -95, -93, -91, -89, -68, -64, -63, -57, -49, -40, -8, 3, 16, 18, 65, 75, 76, 88, 104, 122, 124, 128, 144], -7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 47 in the list [-81, -79, -77, -76, -65, -55, -49, -46, -45, -41, -40, -39, -38, -20, -18, -4, -1, 1, 13, 24, 37, 42, 47, 51, 57, 65, 68, 76, 80, 107, 120, 127, 135, 138].","[-81, -79, -77, -76, -65, -55, -49, -46, -45, -41, -40, -39, -38, -20, -18, -4, -1, 1, 13, 24, 37, 42, 47, 51, 57, 65, 68, 76, 80, 107, 120, 127, 135, 138], 47",Element found at index 22,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 25 in the list [-98, -89, -84, -83, -79, -72, -40, -32, -31, -24, 21, 35, 55, 65, 75, 92, 103, 108, 118, 119, 129, 136, 140].","[-98, -89, -84, -83, -79, -72, -40, -32, -31, -24, 21, 35, 55, 65, 75, 92, 103, 108, 118, 119, 129, 136, 140], 25",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 56 in the array [-97, -91, -74, -73, -67, -64, -60, -54, -45, -39, -34, -33, -28, -23, -14, -8, -3, 26, 27, 34, 36, 41, 42, 65, 77, 84, 89, 97, 100, 104, 109, 110, 114, 118, 119, 123, 133, 136, 137, 140, 145].","[-97, -91, -74, -73, -67, -64, -60, -54, -45, -39, -34, -33, -28, -23, -14, -8, -3, 26, 27, 34, 36, 41, 42, 65, 77, 84, 89, 97, 100, 104, 109, 110, 114, 118, 119, 123, 133, 136, 137, 140, 145], 56",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -24 in the array [-97, -95, -72, -66, -62, -60, -59, -55, -53, -50, -47, -44, -33, -24, -5, 11, 14, 20, 27, 37, 38, 45, 49, 56, 65, 72, 91, 93, 103, 106, 107, 114, 118, 123, 126, 147].","[-97, -95, -72, -66, -62, -60, -59, -55, -53, -50, -47, -44, -33, -24, -5, 11, 14, 20, 27, 37, 38, 45, 49, 56, 65, 72, 91, 93, 103, 106, 107, 114, 118, 123, 126, 147], -24",Element found at index 13,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 75 exists in [-77, -75, -44, -37, -36, -32, -29, -22, -20, -4, -1, 1, 19, 20, 21, 47, 54, 62, 64, 75, 87, 90, 124, 132, 135, 139, 146].","[-77, -75, -44, -37, -36, -32, -29, -22, -20, -4, -1, 1, 19, 20, 21, 47, 54, 62, 64, 75, 87, 90, 124, 132, 135, 139, 146], 75",Element found at index 19,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -3 in the following list: [-97, -81, -79, -78, -72, -69, -67, -53, -47, -36, -27, -25, -18, -11, -10, -7, 8, 16, 21, 32, 44, 47, 55, 61, 62, 63, 78, 93, 95, 98, 105, 108, 115, 117, 127, 139, 141, 142].","[-97, -81, -79, -78, -72, -69, -67, -53, -47, -36, -27, -25, -18, -11, -10, -7, 8, 16, 21, 32, 44, 47, 55, 61, 62, 63, 78, 93, 95, 98, 105, 108, 115, 117, 127, 139, 141, 142], -3",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 35 in the array [-95, -94, -90, -79, -67, -57, -52, -36, -34, -33, -7, -3, 43, 45, 50, 55, 56, 58, 67, 68, 76, 77, 82, 92, 103, 104, 108, 115, 118, 119, 128, 135].","[-95, -94, -90, -79, -67, -57, -52, -36, -34, -33, -7, -3, 43, 45, 50, 55, 56, 58, 67, 68, 76, 77, 82, 92, 103, 104, 108, 115, 118, 119, 128, 135], 35",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -5 exists in [-100, -98, -79, -75, -71, -64, -50, -45, -40, -39, -6, -5, -2, 15, 35, 44, 52, 54, 56, 58, 60, 76, 102, 122, 141].","[-100, -98, -79, -75, -71, -64, -50, -45, -40, -39, -6, -5, -2, 15, 35, 44, 52, 54, 56, 58, 60, 76, 102, 122, 141], -5",Element found at index 11,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 13 exists in [-71, -35, 4, 19, 27, 54, 57, 65, 86, 91, 104, 107, 113, 128, 130].","[-71, -35, 4, 19, 27, 54, 57, 65, 86, 91, 104, 107, 113, 128, 130], 13",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 51 in the following list: [-89, -86, -85, -78, -63, -51, -45, -29, -28, -24, -23, -18, -8, -5, 8, 21, 35, 38, 43, 44, 45, 46, 55, 57, 61, 67, 68, 71, 73, 75, 77, 81, 82, 89, 96, 102, 111, 116, 119, 127, 128, 131, 132, 138, 141, 147].","[-89, -86, -85, -78, -63, -51, -45, -29, -28, -24, -23, -18, -8, -5, 8, 21, 35, 38, 43, 44, 45, 46, 55, 57, 61, 67, 68, 71, 73, 75, 77, 81, 82, 89, 96, 102, 111, 116, 119, 127, 128, 131, 132, 138, 141, 147], 51",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -5 appear in [-98, -81, -58, -35, -28, -26, -14, -12, -11, -4, 4, 16, 21, 38, 51, 56, 64, 69, 71, 73, 101, 102, 116, 121, 127, 140, 142, 143]? Use linear search to check.","[-98, -81, -58, -35, -28, -26, -14, -12, -11, -4, 4, 16, 21, 38, 51, 56, 64, 69, 71, 73, 101, 102, 116, 121, 127, 140, 142, 143], -5",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 67 exists in [-99, -97, -87, -82, -74, -63, -59, -55, -47, -46, -44, -43, -37, -35, -33, -22, -16, -2, 10, 16, 30, 36, 45, 50, 52, 60, 61, 62, 64, 68, 70, 74, 76, 78, 79, 83, 85, 95, 103, 108, 128, 130, 143].","[-99, -97, -87, -82, -74, -63, -59, -55, -47, -46, -44, -43, -37, -35, -33, -22, -16, -2, 10, 16, 30, 36, 45, 50, 52, 60, 61, 62, 64, 68, 70, 74, 76, 78, 79, 83, 85, 95, 103, 108, 128, 130, 143], 67",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 31 in the list [-84, -79, -71, -68, 0, 2, 9, 11, 58, 78, 92, 117].","[-84, -79, -71, -68, 0, 2, 9, 11, 58, 78, 92, 117], 31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 80 appear in [14, 39, 82, 90, 121, 142, 149]? Use linear search to check.","[14, 39, 82, 90, 121, 142, 149], 80",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 80 in the list [-97, -96, -80, -79, -77, -75, -74, -68, -67, -63, -61, -54, -37, -30, -26, -25, -19, -13, -11, -5, 3, 8, 11, 14, 15, 29, 39, 43, 48, 53, 58, 69, 73, 77, 88, 119, 133].","[-97, -96, -80, -79, -77, -75, -74, -68, -67, -63, -61, -54, -37, -30, -26, -25, -19, -13, -11, -5, 3, 8, 11, 14, 15, 29, 39, 43, 48, 53, 58, 69, 73, 77, 88, 119, 133], 80",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 66 in the array [-96, -94, -91, -86, -67, -65, -63, -58, -48, -38, -35, -30, -22, -16, -1, 10, 11, 14, 16, 20, 21, 32, 50, 55, 59, 64, 65, 70, 72, 97, 102, 105, 111, 131, 139].","[-96, -94, -91, -86, -67, -65, -63, -58, -48, -38, -35, -30, -22, -16, -1, 10, 11, 14, 16, 20, 21, 32, 50, 55, 59, 64, 65, 70, 72, 97, 102, 105, 111, 131, 139], 66",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -36 exists in [-94, -93, -92, -89, -85, -78, -74, -73, -67, -64, -62, -60, -59, -46, -43, -42, -39, -35, -23, -13, -8, 10, 15, 33, 37, 63, 66, 68, 74, 75, 85, 111, 116, 119, 122, 134, 137].","[-94, -93, -92, -89, -85, -78, -74, -73, -67, -64, -62, -60, -59, -46, -43, -42, -39, -35, -23, -13, -8, 10, 15, 33, 37, 63, 66, 68, 74, 75, 85, 111, 116, 119, 122, 134, 137], -36",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 39 appear in [-86, -6, -1, 4, 14, 23, 32, 42, 44, 47, 60, 73, 86, 96, 117]? Use linear search to check.","[-86, -6, -1, 4, 14, 23, 32, 42, 44, 47, 60, 73, 86, 96, 117], 39",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -2 in the array [-94, -87, -76, -73, -70, -67, -65, -55, -54, -53, -31, -30, -25, -14, 0, 2, 11, 14, 22, 41, 54, 62, 71, 73, 78, 87, 91, 96, 101, 136, 140, 147, 149].","[-94, -87, -76, -73, -70, -67, -65, -55, -54, -53, -31, -30, -25, -14, 0, 2, 11, 14, 22, 41, 54, 62, 71, 73, 78, 87, 91, 96, 101, 136, 140, 147, 149], -2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 19 exists in [-96, -95, -94, -78, -61, -47, -46, -45, -25, -14, -3, 9, 24, 25, 29, 30, 34, 36, 39, 57, 78, 88, 90, 114, 143, 146, 149].","[-96, -95, -94, -78, -61, -47, -46, -45, -25, -14, -3, 9, 24, 25, 29, 30, 34, 36, 39, 57, 78, 88, 90, 114, 143, 146, 149], 19",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -21 appear in [-95, -92, -84, -82, -70, -62, -49, -40, -35, -10, -3, 19, 20, 23, 36, 70, 86, 87, 111, 141, 146, 148]? Use linear search to check.","[-95, -92, -84, -82, -70, -62, -49, -40, -35, -10, -3, 19, 20, 23, 36, 70, 86, 87, 111, 141, 146, 148], -21",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 53 in the array [-98, -95, -88, -87, -83, -80, -78, -72, -70, -59, -56, -54, -46, -45, -44, -36, -26, -23, -6, -3, 18, 28, 30, 36, 42, 46, 54, 63, 69, 83, 86, 104, 105, 108, 109, 112, 117, 118, 127, 138, 145].","[-98, -95, -88, -87, -83, -80, -78, -72, -70, -59, -56, -54, -46, -45, -44, -36, -26, -23, -6, -3, 18, 28, 30, 36, 42, 46, 54, 63, 69, 83, 86, 104, 105, 108, 109, 112, 117, 118, 127, 138, 145], 53",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -4 exists in [-97, -96, -72, -62, -60, -56, -55, -48, -39, -38, -32, -18, -9, -8, -2, 1, 3, 7, 22, 28, 29, 30, 36, 42, 43, 46, 48, 55, 62, 74, 75, 80, 85, 89, 90, 93, 101, 103, 114, 115, 130, 132, 134, 139, 142].","[-97, -96, -72, -62, -60, -56, -55, -48, -39, -38, -32, -18, -9, -8, -2, 1, 3, 7, 22, 28, 29, 30, 36, 42, 43, 46, 48, 55, 62, 74, 75, 80, 85, 89, 90, 93, 101, 103, 114, 115, 130, 132, 134, 139, 142], -4",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 10 exists in [-98, -83, -78, -69, -68, -51, -20, -16, -4, -1, 7, 9, 20, 22, 28, 48, 51, 54, 63, 67, 70, 74, 82, 84, 91, 94, 96, 106, 112, 120, 126].","[-98, -83, -78, -69, -68, -51, -20, -16, -4, -1, 7, 9, 20, 22, 28, 48, 51, 54, 63, 67, 70, 74, 82, 84, 91, 94, 96, 106, 112, 120, 126], 10",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 48 in the array [-98, -86, -84, -79, -76, -72, -68, -53, -51, -39, -31, -16, -8, 24, 27, 31, 36, 40, 41, 50, 58, 68, 84, 91, 100, 101, 102, 131, 135, 138].","[-98, -86, -84, -79, -76, -72, -68, -53, -51, -39, -31, -16, -8, 24, 27, 31, 36, 40, 41, 50, 58, 68, 84, 91, 100, 101, 102, 131, 135, 138], 48",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -4 in the array [-77, -27, 6, 7, 90, 99, 106, 112, 129, 148].","[-77, -27, 6, 7, 90, 99, 106, 112, 129, 148], -4",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 62 in the following list: [-100, -76, -57, 88, 102, 125, 127].","[-100, -76, -57, 88, 102, 125, 127], 62",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Medium Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 71 appear in [-88, -82, -73, -72, -70, -66, -61, -59, -57, -43, -42, -18, -12, -9, -4, -2, 0, 4, 12, 21, 22, 30, 32, 40, 41, 45, 48, 50, 52, 75, 86, 88, 92, 95, 102, 112, 125, 131, 134, 135, 136, 141, 143, 149]? Use linear search to check.","[-88, -82, -73, -72, -70, -66, -61, -59, -57, -43, -42, -18, -12, -9, -4, -2, 0, 4, 12, 21, 22, 30, 32, 40, 41, 45, 48, 50, 52, 75, 86, 88, 92, 95, 102, 112, 125, 131, 134, 135, 136, 141, 143, 149], 71",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 53 exists in [-16, 61, 67, 69, 76, 109, 149].","[-16, 61, 67, 69, 76, 109, 149], 53",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 23 in the following list: [-42, -28, -6, 8, 33, 44, 50, 61, 63, 66, 72, 86, 95, 97, 108, 109, 110, 132, 143].","[-42, -28, -6, 8, 33, 44, 50, 61, 63, 66, 72, 86, 95, 97, 108, 109, 110, 132, 143], 23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 78 in the array [-100, -89, -83, -62, -53, -43, -32, -9, 0, 9, 14, 17, 19, 31, 33, 35, 46, 85, 86, 95, 115, 119, 126, 139, 140].","[-100, -89, -83, -62, -53, -43, -32, -9, 0, 9, 14, 17, 19, 31, 33, 35, 46, 85, 86, 95, 115, 119, 126, 139, 140], 78",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -35 in the array [-99, -97, -92, -88, -82, -75, -73, -68, -64, -63, -56, -45, -37, -34, -30, -26, -24, -21, -13, -11, 8, 9, 30, 32, 36, 42, 51, 59, 62, 67, 70, 79, 81, 83, 92, 98, 100, 126, 130, 134, 137, 147].","[-99, -97, -92, -88, -82, -75, -73, -68, -64, -63, -56, -45, -37, -34, -30, -26, -24, -21, -13, -11, 8, 9, 30, 32, 36, 42, 51, 59, 62, 67, 70, 79, 81, 83, 92, 98, 100, 126, 130, 134, 137, 147], -35",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 20 in the following list: [-94, -80, -62, -48, -33, -3, 1, 40, 47, 85, 116, 117, 125, 133].","[-94, -80, -62, -48, -33, -3, 1, 40, 47, 85, 116, 117, 125, 133], 20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 59 exists in [-100, -86, -68, -63, -56, -52, -47, -43, -39, -38, -15, -14, -11, -10, -3, -2, -1, 1, 2, 10, 26, 28, 32, 35, 36, 49, 51, 57, 59, 61, 92, 99, 101, 103, 104, 105, 119, 121, 122, 127, 132, 139, 141, 143, 145, 147].","[-100, -86, -68, -63, -56, -52, -47, -43, -39, -38, -15, -14, -11, -10, -3, -2, -1, 1, 2, 10, 26, 28, 32, 35, 36, 49, 51, 57, 59, 61, 92, 99, 101, 103, 104, 105, 119, 121, 122, 127, 132, 139, 141, 143, 145, 147], 59",Element found at index 28,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -3 in the following list: [-90, -79, -15, -4, 40, 125, 136].","[-90, -79, -15, -4, 40, 125, 136], -3",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 68 appear in [-85, -51, -27, -11, 20, 70, 73, 79, 101, 115, 125, 139]? Use linear search to check.","[-85, -51, -27, -11, 20, 70, 73, 79, 101, 115, 125, 139], 68",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 8 in the following list: [-86, -69, -66, -64, -63, -57, -46, -40, -14, 2, 14, 20, 36, 41, 65, 73, 80, 85, 95, 97, 98, 114, 119, 125, 130, 133, 136, 137, 140, 145].","[-86, -69, -66, -64, -63, -57, -46, -40, -14, 2, 14, 20, 36, 41, 65, 73, 80, 85, 95, 97, 98, 114, 119, 125, 130, 133, 136, 137, 140, 145], 8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -17 in the following list: [-100, -97, -96, -92, -89, -72, -71, -66, -56, -54, -53, -38, -35, -31, -29, -22, -14, -7, -6, 4, 5, 8, 14, 16, 24, 26, 31, 33, 34, 36, 43, 45, 53, 64, 66, 69, 75, 78, 84, 88, 95, 96, 98, 103, 104, 112, 132, 142, 147].","[-100, -97, -96, -92, -89, -72, -71, -66, -56, -54, -53, -38, -35, -31, -29, -22, -14, -7, -6, 4, 5, 8, 14, 16, 24, 26, 31, 33, 34, 36, 43, 45, 53, 64, 66, 69, 75, 78, 84, 88, 95, 96, 98, 103, 104, 112, 132, 142, 147], -17",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 91 in the array [-68, -21, -6, 43, 78, 99, 110, 125].","[-68, -21, -6, 43, 78, 99, 110, 125], 91",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 44 exists in [-68, -58, -35, 51, 65, 77, 100, 119, 132, 145].","[-68, -58, -35, 51, 65, 77, 100, 119, 132, 145], 44",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 68 exists in [-99, -98, -74, -61, -55, -52, -51, -40, -39, -31, -30, -22, -13, -6, -3, 15, 22, 40, 43, 44, 45, 51, 59, 77, 78, 86, 92, 98, 102, 110, 112, 115, 118, 124, 130, 131, 132, 134, 136, 147].","[-99, -98, -74, -61, -55, -52, -51, -40, -39, -31, -30, -22, -13, -6, -3, 15, 22, 40, 43, 44, 45, 51, 59, 77, 78, 86, 92, 98, 102, 110, 112, 115, 118, 124, 130, 131, 132, 134, 136, 147], 68",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 88 exists in [-96, -91, -89, -88, -86, -79, -78, -76, -72, -71, -60, -52, -49, -44, -39, -19, -17, -11, -9, -8, -3, -1, 2, 12, 15, 16, 18, 26, 34, 45, 61, 71, 75, 91, 103, 106, 115, 119, 120, 126, 128, 135, 140, 147].","[-96, -91, -89, -88, -86, -79, -78, -76, -72, -71, -60, -52, -49, -44, -39, -19, -17, -11, -9, -8, -3, -1, 2, 12, 15, 16, 18, 26, 34, 45, 61, 71, 75, 91, 103, 106, 115, 119, 120, 126, 128, 135, 140, 147], 88",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 20 appear in [-98, -97, -89, -84, -71, -70, -68, -63, -61, -56, -50, -39, -22, -20, -19, -10, -2, -1, 5, 13, 15, 16, 17, 34, 44, 51, 54, 60, 94, 110, 117, 126, 128, 135, 142, 144, 147]? Use linear search to check.","[-98, -97, -89, -84, -71, -70, -68, -63, -61, -56, -50, -39, -22, -20, -19, -10, -2, -1, 5, 13, 15, 16, 17, 34, 44, 51, 54, 60, 94, 110, 117, 126, 128, 135, 142, 144, 147], 20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 50 in the list [-78, -76, -61, -52, -25, -20, -19, -6, 3, 22, 23, 36, 47, 48, 70, 91, 95, 106, 121, 126, 143].","[-78, -76, -61, -52, -25, -20, -19, -6, 3, 22, 23, 36, 47, 48, 70, 91, 95, 106, 121, 126, 143], 50",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 94 exists in [-95, -91, -11, -4, 3, 13, 62, 73, 80, 83, 90, 101, 118, 119, 136, 139, 149].","[-95, -91, -11, -4, 3, 13, 62, 73, 80, 83, 90, 101, 118, 119, 136, 139, 149], 94",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 53 exists in [-85, -78, -61, -55, -43, -38, -26, -15, -3, 8, 14, 23, 24, 32, 34, 36, 39, 45, 51, 64, 67, 80, 83, 84, 86, 89, 97, 100, 114, 129, 133, 141, 145, 149].","[-85, -78, -61, -55, -43, -38, -26, -15, -3, 8, 14, 23, 24, 32, 34, 36, 39, 45, 51, 64, 67, 80, 83, 84, 86, 89, 97, 100, 114, 129, 133, 141, 145, 149], 53",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 67 exists in [-80, -8, -1, 25, 107, 127].","[-80, -8, -1, 25, 107, 127], 67",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 44 appear in [-68, 7, 15, 46, 122]? Use linear search to check.","[-68, 7, 15, 46, 122], 44",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -22 appear in [-100, -96, -91, -78, -76, -63, -59, -24, -21, -14, -8, 2, 11, 26, 29, 30, 31, 35, 61, 64, 67, 72, 77, 96, 114, 116, 131, 134, 138, 142]? Use linear search to check.","[-100, -96, -91, -78, -76, -63, -59, -24, -21, -14, -8, 2, 11, 26, 29, 30, 31, 35, 61, 64, 67, 72, 77, 96, 114, 116, 131, 134, 138, 142], -22",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 94 exists in [-99, -95, -80, -74, -72, -70, -69, -68, -65, -53, -41, -35, -33, -23, -17, 0, 6, 8, 33, 71, 73, 77, 81, 86, 89, 99, 112, 125, 126, 133, 143, 145, 149].","[-99, -95, -80, -74, -72, -70, -69, -68, -65, -53, -41, -35, -33, -23, -17, 0, 6, 8, 33, 71, 73, 77, 81, 86, 89, 99, 112, 125, 126, 133, 143, 145, 149], 94",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 45 exists in [-90, -77, -76, -63, -37, -26, -13, -4, 3, 25, 64, 74, 87, 95, 133, 142, 143, 146, 149].","[-90, -77, -76, -63, -37, -26, -13, -4, 3, 25, 64, 74, 87, 95, 133, 142, 143, 146, 149], 45",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -44 in the following list: [-94, -86, -71, -63, -44, -31, -30, -26, -11, -8, 19, 58, 59, 62, 75, 81, 91, 95, 97, 98, 99, 100, 104, 109, 115, 136, 137].","[-94, -86, -71, -63, -44, -31, -30, -26, -11, -8, 19, 58, 59, 62, 75, 81, 91, 95, 97, 98, 99, 100, 104, 109, 115, 136, 137], -44",Element found at index 4,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -2 appear in [-96, -94, -93, -87, -86, -85, -83, -82, -81, -67, -63, -58, -49, -44, -38, -37, -36, -27, -25, -19, -12, -11, -6, -4, 13, 14, 18, 20, 30, 32, 34, 35, 36, 43, 44, 47, 52, 70, 76, 83, 97, 105, 108, 109, 116, 119, 128, 134, 142]? Use linear search to check.","[-96, -94, -93, -87, -86, -85, -83, -82, -81, -67, -63, -58, -49, -44, -38, -37, -36, -27, -25, -19, -12, -11, -6, -4, 13, 14, 18, 20, 30, 32, 34, 35, 36, 43, 44, 47, 52, 70, 76, 83, 97, 105, 108, 109, 116, 119, 128, 134, 142], -2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 91 exists in [-81, -39, -34, -22, 30, 46, 84, 113, 131].","[-81, -39, -34, -22, 30, 46, 84, 113, 131], 91",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 49 appear in [-97, -94, -81, -75, -62, -40, -38, -27, 0, 1, 6, 63, 83, 85, 88, 96, 101, 111, 135, 144]? Use linear search to check.","[-97, -94, -81, -75, -62, -40, -38, -27, 0, 1, 6, 63, 83, 85, 88, 96, 101, 111, 135, 144], 49",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 74 in the list [-96, -61, -34, 12, 35, 41, 88, 98, 117, 149].","[-96, -61, -34, 12, 35, 41, 88, 98, 117, 149], 74",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 86 exists in [-100, -41, -8, 35, 46, 54, 66, 80, 85, 97, 98, 106, 108, 109, 126].","[-100, -41, -8, 35, 46, 54, 66, 80, 85, 97, 98, 106, 108, 109, 126], 86",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -2 exists in [-84, -72, 27, 29, 61, 64].","[-84, -72, 27, 29, 61, 64], -2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 78 in the list [-93, -84, -76, -54, -52, -50, -40, -30, -27, -21, -13, 12, 17, 20, 31, 41, 48, 52, 75, 85, 88, 94, 105, 106, 125, 128, 131].","[-93, -84, -76, -54, -52, -50, -40, -30, -27, -21, -13, 12, 17, 20, 31, 41, 48, 52, 75, 85, 88, 94, 105, 106, 125, 128, 131], 78",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -40 in the array [-97, -96, -91, -89, -78, -69, -63, -61, -60, -58, -57, -54, -53, -52, -51, -48, -42, -31, -26, -23, -17, -4, 4, 13, 14, 17, 22, 39, 45, 50, 61, 92, 95, 99, 102, 111, 114, 115, 119, 122, 124, 128, 131, 136, 144, 147].","[-97, -96, -91, -89, -78, -69, -63, -61, -60, -58, -57, -54, -53, -52, -51, -48, -42, -31, -26, -23, -17, -4, 4, 13, 14, 17, 22, 39, 45, 50, 61, 92, 95, 99, 102, 111, 114, 115, 119, 122, 124, 128, 131, 136, 144, 147], -40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -2 in the list [-97, -93, -85, -84, -76, -70, -64, -57, -53, -38, -32, -25, -21, -11, -9, -6, 3, 14, 24, 26, 31, 36, 55, 60, 65, 105, 106, 112, 117, 119, 127, 131, 135, 140, 142, 146].","[-97, -93, -85, -84, -76, -70, -64, -57, -53, -38, -32, -25, -21, -11, -9, -6, 3, 14, 24, 26, 31, 36, 55, 60, 65, 105, 106, 112, 117, 119, 127, 131, 135, 140, 142, 146], -2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 52 in the array [-89, -66, -37, -29, -24, 3, 6, 20, 64, 93, 115, 121, 148].","[-89, -66, -37, -29, -24, 3, 6, 20, 64, 93, 115, 121, 148], 52",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 53 in the list [-93, -74, -71, -69, -40, -30, -11, 41, 60, 107, 110, 111, 115, 121, 133, 148].","[-93, -74, -71, -69, -40, -30, -11, 41, 60, 107, 110, 111, 115, 121, 133, 148], 53",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -7 appear in [-72, -52, -45, -28, -26, 30, 82, 130]? Use linear search to check.","[-72, -52, -45, -28, -26, 30, 82, 130], -7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 99 in the array [-91, -76, -71, -65, -53, -46, -30, -22, -18, -3, 5, 17, 19, 21, 42, 43, 58, 63, 77, 88, 103, 111, 133, 135, 136, 139, 143].","[-91, -76, -71, -65, -53, -46, -30, -22, -18, -3, 5, 17, 19, 21, 42, 43, 58, 63, 77, 88, 103, 111, 133, 135, 136, 139, 143], 99",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 6 in the list [-81, -43, -40, -38, -31, 22, 41, 46, 65, 73, 84, 90, 92, 93, 97, 105, 111, 117, 126, 130, 138].","[-81, -43, -40, -38, -31, 22, 41, 46, 65, 73, 84, 90, 92, 93, 97, 105, 111, 117, 126, 130, 138], 6",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 54 in the following list: [-98, -97, -75, -53, -47, -44, -29, -23, 5, 19, 28, 34, 37, 46, 51, 62, 63, 65, 122, 123, 130, 136, 147].","[-98, -97, -75, -53, -47, -44, -29, -23, 5, 19, 28, 34, 37, 46, 51, 62, 63, 65, 122, 123, 130, 136, 147], 54",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 97 exists in [-70, -54, -17, -4, 21, 25, 35, 37, 49, 53, 67, 89, 149].","[-70, -54, -17, -4, 21, 25, 35, 37, 49, 53, 67, 89, 149], 97",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 21 in the list [-65, -52, -45, -21, -17, -5, 1, 4, 28, 32, 36, 49, 53, 66, 69, 73, 82, 86, 92, 119, 123, 124, 148].","[-65, -52, -45, -21, -17, -5, 1, 4, 28, 32, 36, 49, 53, 66, 69, 73, 82, 86, 92, 119, 123, 124, 148], 21",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -32 in the following list: [-100, -77, -51, -48, -40, -39, -20, -14, -7, 2, 7, 8, 29, 31, 37, 41, 44, 56, 88, 115, 119, 120, 125, 132, 144].","[-100, -77, -51, -48, -40, -39, -20, -14, -7, 2, 7, 8, 29, 31, 37, 41, 44, 56, 88, 115, 119, 120, 125, 132, 144], -32",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 23 in the list [-94, -91, -79, -76, -61, -54, -51, -36, -25, -23, -21, -11, -6, -1, 3, 8, 13, 18, 24, 25, 29, 31, 47, 48, 61, 62, 66, 70, 76, 77, 78, 79, 82, 86, 90, 96, 97, 103, 108, 109, 110, 111, 115, 119, 122, 125, 137, 144, 146, 148].","[-94, -91, -79, -76, -61, -54, -51, -36, -25, -23, -21, -11, -6, -1, 3, 8, 13, 18, 24, 25, 29, 31, 47, 48, 61, 62, 66, 70, 76, 77, 78, 79, 82, 86, 90, 96, 97, 103, 108, 109, 110, 111, 115, 119, 122, 125, 137, 144, 146, 148], 23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 45 exists in [-95, -94, -90, -78, -73, -60, -55, -42, -40, -29, 19, 28, 45, 57, 70, 86, 93, 106, 116, 119].","[-95, -94, -90, -78, -73, -60, -55, -42, -40, -29, 19, 28, 45, 57, 70, 86, 93, 106, 116, 119], 45",Element found at index 12,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 7 exists in [-100, -96, -88, -83, -72, -70, -69, -68, -57, -39, -37, -29, -24, -20, -17, -15, 8, 10, 16, 27, 34, 35, 45, 51, 56, 61, 62, 68, 73, 94, 99, 114, 120, 123, 135, 136, 138, 147].","[-100, -96, -88, -83, -72, -70, -69, -68, -57, -39, -37, -29, -24, -20, -17, -15, 8, 10, 16, 27, 34, 35, 45, 51, 56, 61, 62, 68, 73, 94, 99, 114, 120, 123, 135, 136, 138, 147], 7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -29 exists in [-90, -87, -68, -60, -58, -9, 35, 50, 58].","[-90, -87, -68, -60, -58, -9, 35, 50, 58], -29",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 58 appear in [-88, -85, -83, -81, -71, -65, -63, -61, -52, -51, -44, -41, -40, -9, -6, -2, 5, 12, 24, 27, 30, 44, 52, 54, 63, 70, 76, 78, 82, 95, 105, 107, 111, 137, 138, 145]? Use linear search to check.","[-88, -85, -83, -81, -71, -65, -63, -61, -52, -51, -44, -41, -40, -9, -6, -2, 5, 12, 24, 27, 30, 44, 52, 54, 63, 70, 76, 78, 82, 95, 105, 107, 111, 137, 138, 145], 58",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -32 exists in [-88, -87, -77, 31, 45, 80, 83, 108, 123].","[-88, -87, -77, 31, 45, 80, 83, 108, 123], -32",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 3 in the array [-97, -94, -92, -84, -69, -67, -40, -37, -29, -16, 2, 3, 4, 13, 16, 35, 42, 56, 69, 105, 119].","[-97, -94, -92, -84, -69, -67, -40, -37, -29, -16, 2, 3, 4, 13, 16, 35, 42, 56, 69, 105, 119], 3",Element found at index 11,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -34 exists in [-82, -24, 49, 61, 71, 138, 140].","[-82, -24, 49, 61, 71, 138, 140], -34",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 67 in the array [-98, -97, -95, -63, -46, -37, -34, -25, -18, -7, -3, 9, 25, 33, 34, 35, 48, 52, 66, 67, 69, 73, 93, 101, 112, 113, 116, 121, 126, 127, 131, 132, 142, 144].","[-98, -97, -95, -63, -46, -37, -34, -25, -18, -7, -3, 9, 25, 33, 34, 35, 48, 52, 66, 67, 69, 73, 93, 101, 112, 113, 116, 121, 126, 127, 131, 132, 142, 144], 67",Element found at index 19,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 99 in the following list: [-90, -76, -74, -64, -34, 7, 12, 32, 59, 89, 110, 111, 115, 119, 122, 132, 139].","[-90, -76, -74, -64, -34, 7, 12, 32, 59, 89, 110, 111, 115, 119, 122, 132, 139], 99",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 86 appear in [-85, -82, -80, -79, -77, -66, -65, -64, -62, -48, -43, -38, -28, -24, -12, -7, -5, -3, 7, 18, 30, 40, 50, 61, 75, 80, 89, 91, 102, 112, 113, 116, 127, 128, 132, 133, 136, 145, 147]? Use linear search to check.","[-85, -82, -80, -79, -77, -66, -65, -64, -62, -48, -43, -38, -28, -24, -12, -7, -5, -3, 7, 18, 30, 40, 50, 61, 75, 80, 89, 91, 102, 112, 113, 116, 127, 128, 132, 133, 136, 145, 147], 86",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -27 in the following list: [-97, -95, -73, 12, 32, 110, 135].","[-97, -95, -73, 12, 32, 110, 135], -27",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -26 exists in [-96, -92, -91, -57, -55, -27, -14, -8, 10, 16, 24, 32, 33, 39, 43, 72, 102, 113, 136].","[-96, -92, -91, -57, -55, -27, -14, -8, 10, 16, 24, 32, 33, 39, 43, 72, 102, 113, 136], -26",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 43 in the following list: [-73, -44, -42, -4, 36, 42, 60, 61, 98, 119, 128].","[-73, -44, -42, -4, 36, 42, 60, 61, 98, 119, 128], 43",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 12 in the list [-98, -95, -84, -75, -74, -71, -68, -63, -62, -55, -53, -52, -51, -48, -45, -41, -40, -38, -21, -18, -4, 7, 10, 14, 16, 20, 23, 43, 44, 53, 66, 83, 85, 97, 105, 106, 107, 114, 121, 131, 137, 147].","[-98, -95, -84, -75, -74, -71, -68, -63, -62, -55, -53, -52, -51, -48, -45, -41, -40, -38, -21, -18, -4, 7, 10, 14, 16, 20, 23, 43, 44, 53, 66, 83, 85, 97, 105, 106, 107, 114, 121, 131, 137, 147], 12",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 24 in the following list: [-92, -88, -49, -22, -17, 8, 44, 83, 88, 92, 96, 112, 125, 143].","[-92, -88, -49, -22, -17, 8, 44, 83, 88, 92, 96, 112, 125, 143], 24",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 97 appear in [-84, -82, -76, -49, -46, -39, -38, -34, -23, -18, -17, -9, -6, -5, 3, 8, 10, 14, 25, 29, 40, 53, 54, 56, 62, 67, 75, 81, 82, 88, 94, 95, 105, 125, 127, 128, 143, 147]? Use linear search to check.","[-84, -82, -76, -49, -46, -39, -38, -34, -23, -18, -17, -9, -6, -5, 3, 8, 10, 14, 25, 29, 40, 53, 54, 56, 62, 67, 75, 81, 82, 88, 94, 95, 105, 125, 127, 128, 143, 147], 97",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 76 in the list [-83, -73, -72, -71, -69, -62, -58, -42, -40, -32, -25, -24, -22, -21, -6, 1, 7, 15, 16, 17, 19, 22, 43, 52, 64, 75, 76, 86, 98, 113, 114, 117, 132, 138, 143, 144, 147].","[-83, -73, -72, -71, -69, -62, -58, -42, -40, -32, -25, -24, -22, -21, -6, 1, 7, 15, 16, 17, 19, 22, 43, 52, 64, 75, 76, 86, 98, 113, 114, 117, 132, 138, 143, 144, 147], 76",Element found at index 26,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 53 in the array [-90, -80, -72, -59, -54, -47, -41, -36, -32, -31, -23, -21, -19, -18, -16, -9, -8, -6, -3, 17, 22, 24, 28, 32, 51, 52, 53, 57, 60, 61, 84, 86, 102, 108, 109, 112, 115, 116, 117, 119, 126, 135, 137, 138, 139].","[-90, -80, -72, -59, -54, -47, -41, -36, -32, -31, -23, -21, -19, -18, -16, -9, -8, -6, -3, 17, 22, 24, 28, 32, 51, 52, 53, 57, 60, 61, 84, 86, 102, 108, 109, 112, 115, 116, 117, 119, 126, 135, 137, 138, 139], 53",Element found at index 26,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 34 exists in [-94, -92, -63, -42, -37, -28, -6, -5, 0, 1, 6, 8, 12, 13, 38, 51, 55, 63, 84, 88, 99, 103, 122, 139, 143, 149].","[-94, -92, -63, -42, -37, -28, -6, -5, 0, 1, 6, 8, 12, 13, 38, 51, 55, 63, 84, 88, 99, 103, 122, 139, 143, 149], 34",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 31 exists in [-92, -89, -85, -72, -66, -55, -43, -34, -18, -5, 12, 19, 22, 26, 39, 59, 66, 78, 94, 110, 144, 145].","[-92, -89, -85, -72, -66, -55, -43, -34, -18, -5, 12, 19, 22, 26, 39, 59, 66, 78, 94, 110, 144, 145], 31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 10 in the array [-90, -89, -83, -49, -40, -28, 103].","[-90, -89, -83, -49, -40, -28, 103], 10",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -5 appear in [-100, -97, -86, -77, -73, -60, -31, -23, -20, -17, -7, -5, -1, 14, 18, 21, 25, 26, 30, 31, 36, 38, 42, 46, 55, 58, 62, 72, 82, 90, 93, 98, 110, 115, 119, 134, 142]? Use linear search to check.","[-100, -97, -86, -77, -73, -60, -31, -23, -20, -17, -7, -5, -1, 14, 18, 21, 25, 26, 30, 31, 36, 38, 42, 46, 55, 58, 62, 72, 82, 90, 93, 98, 110, 115, 119, 134, 142], -5",Element found at index 11,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 95 appear in [-92, -75, -61, -54, -39, -35, -32, -30, -19, 2, 33, 49, 60, 77, 97, 99, 103, 112, 123, 127, 143, 146]? Use linear search to check.","[-92, -75, -61, -54, -39, -35, -32, -30, -19, 2, 33, 49, 60, 77, 97, 99, 103, 112, 123, 127, 143, 146], 95",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 60 in the list [-98, -92, -73, -72, -59, -31, -30, -3, 48, 116].","[-98, -92, -73, -72, -59, -31, -30, -3, 48, 116], 60",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 85 in the list [-78, -77, -70, -42, -32, -24, -3, 22, 29, 40, 50, 60, 94, 95, 118].","[-78, -77, -70, -42, -32, -24, -3, 22, 29, 40, 50, 60, 94, 95, 118], 85",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 35 in the following list: [-97, -88, -60, -58, -47, -42, -29, 17, 20, 32, 40, 63, 76, 89, 109, 120, 121, 129].","[-97, -88, -60, -58, -47, -42, -29, 17, 20, 32, 40, 63, 76, 89, 109, 120, 121, 129], 35",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 53 in the array [-96, -90, -75, -70, -66, -64, -63, -60, -56, -47, -46, -44, -42, -34, -32, -22, -6, -4, 4, 9, 13, 16, 19, 25, 26, 28, 35, 36, 40, 44, 62, 63, 74, 82, 91, 102, 106, 123, 124, 127, 129, 134, 140, 145, 149].","[-96, -90, -75, -70, -66, -64, -63, -60, -56, -47, -46, -44, -42, -34, -32, -22, -6, -4, 4, 9, 13, 16, 19, 25, 26, 28, 35, 36, 40, 44, 62, 63, 74, 82, 91, 102, 106, 123, 124, 127, 129, 134, 140, 145, 149], 53",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 18 appear in [-96, -51, -36, -30, 26, 45, 51]? Use linear search to check.","[-96, -51, -36, -30, 26, 45, 51], 18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 70 in the following list: [-95, -91, -55, -35, 33, 37, 45, 61, 101, 106, 140].","[-95, -91, -55, -35, 33, 37, 45, 61, 101, 106, 140], 70",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 47 in the array [-89, -78, -59, 2, 13, 15, 22, 62].","[-89, -78, -59, 2, 13, 15, 22, 62], 47",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -2 exists in [-96, -84, -82, -73, -70, -56, -52, -36, -23, -17, -15, -13, -11, -3, -1, 1, 3, 7, 13, 18, 22, 24, 25, 38, 58, 64, 66, 68, 73, 75, 78, 84, 87, 89, 93, 101, 112, 118, 122, 124, 125, 139, 146].","[-96, -84, -82, -73, -70, -56, -52, -36, -23, -17, -15, -13, -11, -3, -1, 1, 3, 7, 13, 18, 22, 24, 25, 38, 58, 64, 66, 68, 73, 75, 78, 84, 87, 89, 93, 101, 112, 118, 122, 124, 125, 139, 146], -2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 83 exists in [-91, -87, -47, -43, -42, -12, 13, 49, 74, 84, 110].","[-91, -87, -47, -43, -42, -12, 13, 49, 74, 84, 110], 83",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 41 in the following list: [-97, -95, -74, -64, -63, -60, -43, -37, -16, -10, 0, 9, 14, 27, 36, 38, 50, 51, 75, 76, 79, 85, 123, 144, 146].","[-97, -95, -74, -64, -63, -60, -43, -37, -16, -10, 0, 9, 14, 27, 36, 38, 50, 51, 75, 76, 79, 85, 123, 144, 146], 41",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -10 appear in [-89, -87, -86, -83, -77, -73, -72, -68, -43, -34, -33, -28, -27, -25, -23, -22, -17, -11, -4, -1, 5, 7, 12, 13, 17, 28, 36, 40, 43, 51, 52, 62, 65, 75, 79, 82, 84, 88, 96, 97, 104, 107, 109, 119, 128, 133, 145]? Use linear search to check.","[-89, -87, -86, -83, -77, -73, -72, -68, -43, -34, -33, -28, -27, -25, -23, -22, -17, -11, -4, -1, 5, 7, 12, 13, 17, 28, 36, 40, 43, 51, 52, 62, 65, 75, 79, 82, 84, 88, 96, 97, 104, 107, 109, 119, 128, 133, 145], -10",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 67 appear in [-95, -93, -91, -85, -82, -81, -75, -67, -62, -61, -57, -53, -50, -48, -45, -39, -8, 15, 21, 24, 28, 29, 30, 54, 58, 59, 66, 73, 75, 90, 91, 96, 121, 130, 131, 135, 145]? Use linear search to check.","[-95, -93, -91, -85, -82, -81, -75, -67, -62, -61, -57, -53, -50, -48, -45, -39, -8, 15, 21, 24, 28, 29, 30, 54, 58, 59, 66, 73, 75, 90, 91, 96, 121, 130, 131, 135, 145], 67",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -8 in the following list: [-100, -96, -95, -93, -91, -76, -61, -55, -37, -36, -30, -28, -24, -14, -12, -10, -9, -6, 8, 13, 20, 25, 28, 30, 35, 36, 37, 38, 41, 42, 43, 49, 52, 59, 62, 67, 68, 72, 75, 80, 96, 99, 100, 112, 118, 119, 129, 130, 143, 147].","[-100, -96, -95, -93, -91, -76, -61, -55, -37, -36, -30, -28, -24, -14, -12, -10, -9, -6, 8, 13, 20, 25, 28, 30, 35, 36, 37, 38, 41, 42, 43, 49, 52, 59, 62, 67, 68, 72, 75, 80, 96, 99, 100, 112, 118, 119, 129, 130, 143, 147], -8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -15 in the list [-90, -17, -5, 38, 92, 100, 106, 109, 115, 120].","[-90, -17, -5, 38, 92, 100, 106, 109, 115, 120], -15",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -23 in the following list: [-100, -93, -75, -70, -50, -49, -41, -40, -35, -26, -25, -20, -15, -14, -8, -7, 3, 7, 15, 19, 27, 33, 39, 42, 50, 63, 71, 96, 103, 113, 114, 116, 121, 123].","[-100, -93, -75, -70, -50, -49, -41, -40, -35, -26, -25, -20, -15, -14, -8, -7, 3, 7, 15, 19, 27, 33, 39, 42, 50, 63, 71, 96, 103, 113, 114, 116, 121, 123], -23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 30 exists in [-92, -71, -56, -47, -38, -14, 12, 14, 24, 27, 37, 63, 70, 72, 108, 127, 132, 143, 147].","[-92, -71, -56, -47, -38, -14, 12, 14, 24, 27, 37, 63, 70, 72, 108, 127, 132, 143, 147], 30",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 51 exists in [-96, -81, -80, -75, -66, -64, -61, -59, -55, -54, -53, -47, -42, -41, -27, -19, -5, 6, 10, 18, 23, 33, 49, 51, 53, 58, 59, 67, 80, 82, 90, 95, 99, 105, 115, 116, 120, 129].","[-96, -81, -80, -75, -66, -64, -61, -59, -55, -54, -53, -47, -42, -41, -27, -19, -5, 6, 10, 18, 23, 33, 49, 51, 53, 58, 59, 67, 80, 82, 90, 95, 99, 105, 115, 116, 120, 129], 51",Element found at index 23,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -11 exists in [-94, -90, -88, -67, -66, -63, -50, -47, -43, -31, -27, -24, -19, -18, -13, -7, -3, 2, 3, 5, 6, 10, 18, 23, 25, 28, 37, 45, 56, 59, 64, 79, 81, 105, 113, 115, 127, 133, 138, 146].","[-94, -90, -88, -67, -66, -63, -50, -47, -43, -31, -27, -24, -19, -18, -13, -7, -3, 2, 3, 5, 6, 10, 18, 23, 25, 28, 37, 45, 56, 59, 64, 79, 81, 105, 113, 115, 127, 133, 138, 146], -11",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -4 in the array [-97, -87, -79, -73, -65, -57, -56, -34, -28, -23, -16, -14, -10, -6, 9, 15, 26, 32, 34, 39, 41, 42, 43, 44, 55, 60, 70, 74, 82, 90, 95, 98, 100, 110, 114, 124, 128, 129, 136, 138, 140, 143].","[-97, -87, -79, -73, -65, -57, -56, -34, -28, -23, -16, -14, -10, -6, 9, 15, 26, 32, 34, 39, 41, 42, 43, 44, 55, 60, 70, 74, 82, 90, 95, 98, 100, 110, 114, 124, 128, 129, 136, 138, 140, 143], -4",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 21 exists in [-90, -87, -80, -61, -47, -38, -25, -10, 6, 11, 14, 18, 29, 38, 44, 47, 71, 72, 90, 95, 100, 105, 109, 122, 125, 131, 133, 136, 138, 143].","[-90, -87, -80, -61, -47, -38, -25, -10, 6, 11, 14, 18, 29, 38, 44, 47, 71, 72, 90, 95, 100, 105, 109, 122, 125, 131, 133, 136, 138, 143], 21",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 93 exists in [-86, -77, -52, -42, -37, -5, 20, 30, 33, 55, 62, 83, 87, 127, 140].","[-86, -77, -52, -42, -37, -5, 20, 30, 33, 55, 62, 83, 87, 127, 140], 93",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 22 in the array [-82, -80, -26, -10, 31, 92].","[-82, -80, -26, -10, 31, 92], 22",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 11 appear in [-96, -94, -75, -72, -60, -59, -51, -48, -30, -26, -23, -11, -10, 3, 8, 13, 25, 49, 52, 56, 76, 87, 95, 101, 105, 122, 125, 126, 132, 133, 137, 138, 143, 145, 146, 148]? Use linear search to check.","[-96, -94, -75, -72, -60, -59, -51, -48, -30, -26, -23, -11, -10, 3, 8, 13, 25, 49, 52, 56, 76, 87, 95, 101, 105, 122, 125, 126, 132, 133, 137, 138, 143, 145, 146, 148], 11",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -16 exists in [-96, -95, -79, -70, -69, -64, -60, -57, -51, -50, -47, -46, -44, -42, -35, -31, -28, -27, -26, -5, 3, 8, 12, 24, 26, 31, 32, 35, 38, 44, 46, 48, 55, 60, 64, 66, 67, 76, 78, 83, 86, 93, 102, 116, 129, 148].","[-96, -95, -79, -70, -69, -64, -60, -57, -51, -50, -47, -46, -44, -42, -35, -31, -28, -27, -26, -5, 3, 8, 12, 24, 26, 31, 32, 35, 38, 44, 46, 48, 55, 60, 64, 66, 67, 76, 78, 83, 86, 93, 102, 116, 129, 148], -16",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 0 in the array [-76, -62, -52, -46, -45, -44, -36, -33, -27, -24, -23, -18, -15, -14, -5, 0, 4, 10, 22, 29, 33, 34, 35, 38, 47, 49, 60, 61, 62, 74, 80, 81, 97, 103, 109, 110, 111, 112, 114, 118, 119, 135, 138, 139, 142, 148].","[-76, -62, -52, -46, -45, -44, -36, -33, -27, -24, -23, -18, -15, -14, -5, 0, 4, 10, 22, 29, 33, 34, 35, 38, 47, 49, 60, 61, 62, 74, 80, 81, 97, 103, 109, 110, 111, 112, 114, 118, 119, 135, 138, 139, 142, 148], 0",Element found at index 15,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 48 in the following list: [-95, -93, -80, -74, -69, -61, -38, -33, -31, -26, -22, -21, -9, -6, -2, 0, 1, 8, 9, 12, 13, 24, 26, 34, 37, 48, 50, 53, 54, 58, 66, 71, 74, 77, 78, 82, 92, 98, 103, 109, 114, 124, 129, 131, 132, 134, 138, 147, 148].","[-95, -93, -80, -74, -69, -61, -38, -33, -31, -26, -22, -21, -9, -6, -2, 0, 1, 8, 9, 12, 13, 24, 26, 34, 37, 48, 50, 53, 54, 58, 66, 71, 74, 77, 78, 82, 92, 98, 103, 109, 114, 124, 129, 131, 132, 134, 138, 147, 148], 48",Element found at index 25,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -22 in the array [-50, -10, 40, 100, 144, 145, 149].","[-50, -10, 40, 100, 144, 145, 149], -22",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 3 in the array [-91, -84, -82, -80, -63, -60, -55, -51, -27, -24, -11, -7, -1, 1, 23, 24, 52, 56, 76, 97, 99, 111, 129, 140].","[-91, -84, -82, -80, -63, -60, -55, -51, -27, -24, -11, -7, -1, 1, 23, 24, 52, 56, 76, 97, 99, 111, 129, 140], 3",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 39 appear in [-99, -86, -82, -70, -48, -40, -28, -26, -22, -9, 1, 12, 14, 21, 24, 26, 51, 56, 82, 86, 130, 131]? Use linear search to check.","[-99, -86, -82, -70, -48, -40, -28, -26, -22, -9, 1, 12, 14, 21, 24, 26, 51, 56, 82, 86, 130, 131], 39",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -9 exists in [-70, -66, -64, -60, -54, -51, -45, -42, -40, -30, -21, -17, -14, -4, -2, 1, 9, 10, 17, 18, 19, 25, 29, 50, 58, 66, 74, 81, 83, 92, 99, 116, 124, 128, 134, 135, 137, 138].","[-70, -66, -64, -60, -54, -51, -45, -42, -40, -30, -21, -17, -14, -4, -2, 1, 9, 10, 17, 18, 19, 25, 29, 50, 58, 66, 74, 81, 83, 92, 99, 116, 124, 128, 134, 135, 137, 138], -9",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -21 appear in [-85, -61, -58, -47, -29, -1, 6, 101, 104, 135]? Use linear search to check.","[-85, -61, -58, -47, -29, -1, 6, 101, 104, 135], -21",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 25 in the following list: [-92, -84, -80, -77, -72, -53, -45, -38, -23, -11, -8, 2, 7, 8, 10, 19, 25, 32, 34, 56, 57, 66, 72, 75, 78, 81, 87, 91, 98, 99, 123, 126].","[-92, -84, -80, -77, -72, -53, -45, -38, -23, -11, -8, 2, 7, 8, 10, 19, 25, 32, 34, 56, 57, 66, 72, 75, 78, 81, 87, 91, 98, 99, 123, 126], 25",Element found at index 16,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -23 exists in [-99, -96, -95, -92, -85, -82, -73, -69, -62, -57, -55, -52, -36, -29, -16, -8, -4, -1, 1, 10, 15, 23, 33, 34, 36, 39, 44, 51, 52, 56, 57, 61, 63, 71, 75, 78, 81, 89, 93, 96, 103, 104, 114, 120, 128, 129, 135, 143].","[-99, -96, -95, -92, -85, -82, -73, -69, -62, -57, -55, -52, -36, -29, -16, -8, -4, -1, 1, 10, 15, 23, 33, 34, 36, 39, 44, 51, 52, 56, 57, 61, 63, 71, 75, 78, 81, 89, 93, 96, 103, 104, 114, 120, 128, 129, 135, 143], -23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -20 appear in [-91, -86, -83, -81, -74, -67, -54, -53, -52, -51, -39, -34, -27, -23, -22, -19, -7, 3, 8, 10, 17, 18, 29, 57, 64, 71, 73, 74, 78, 100, 106, 131, 142]? Use linear search to check.","[-91, -86, -83, -81, -74, -67, -54, -53, -52, -51, -39, -34, -27, -23, -22, -19, -7, 3, 8, 10, 17, 18, 29, 57, 64, 71, 73, 74, 78, 100, 106, 131, 142], -20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 62 in the following list: [-100, -97, -93, -92, -91, -88, -87, -81, -79, -78, -76, -68, -52, -47, -40, -38, -37, -32, -30, -6, -4, -1, 11, 17, 19, 29, 30, 39, 53, 55, 60, 67, 70, 77, 82, 86, 102, 103, 110, 116, 119, 129, 130, 131, 133, 144, 147, 149].","[-100, -97, -93, -92, -91, -88, -87, -81, -79, -78, -76, -68, -52, -47, -40, -38, -37, -32, -30, -6, -4, -1, 11, 17, 19, 29, 30, 39, 53, 55, 60, 67, 70, 77, 82, 86, 102, 103, 110, 116, 119, 129, 130, 131, 133, 144, 147, 149], 62",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 90 in the following list: [-96, -92, -78, -32, -22, -6, 11, 24, 40, 81, 84, 113, 116].","[-96, -92, -78, -32, -22, -6, 11, 24, 40, 81, 84, 113, 116], 90",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 69 in the array [-91, -60, -58, -50, -49, -47, -39, -24, -23, -9, -6, 24, 31, 33, 37, 39, 44, 57, 62, 66, 72, 83, 87, 91, 92, 101, 113, 118, 125, 134, 148, 149].","[-91, -60, -58, -50, -49, -47, -39, -24, -23, -9, -6, 24, 31, 33, 37, 39, 44, 57, 62, 66, 72, 83, 87, 91, 92, 101, 113, 118, 125, 134, 148, 149], 69",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -5 in the list [-61, -57, 8, 32, 39, 63, 90, 100, 141].","[-61, -57, 8, 32, 39, 63, 90, 100, 141], -5",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -10 exists in [-100, -66, -61, -53, -7, 5, 59, 63, 83, 97, 107, 115, 120].","[-100, -66, -61, -53, -7, 5, 59, 63, 83, 97, 107, 115, 120], -10",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 61 exists in [-89, -83, -81, -78, -61, -59, -55, -50, -40, -37, -22, 0, 4, 6, 13, 18, 22, 32, 33, 44, 48, 52, 72, 85, 94, 95, 103, 104, 110, 133, 135, 140, 145].","[-89, -83, -81, -78, -61, -59, -55, -50, -40, -37, -22, 0, 4, 6, 13, 18, 22, 32, 33, 44, 48, 52, 72, 85, 94, 95, 103, 104, 110, 133, 135, 140, 145], 61",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -18 in the array [-100, -97, -90, -86, -84, -83, -82, -80, -71, -69, -68, -55, -52, -48, -46, -35, -31, -22, -15, -14, -8, -2, 0, 11, 16, 18, 19, 21, 36, 53, 77, 78, 83, 91, 95, 112, 120, 141, 148].","[-100, -97, -90, -86, -84, -83, -82, -80, -71, -69, -68, -55, -52, -48, -46, -35, -31, -22, -15, -14, -8, -2, 0, 11, 16, 18, 19, 21, 36, 53, 77, 78, 83, 91, 95, 112, 120, 141, 148], -18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 27 exists in [-99, -98, -95, -92, -84, -83, -75, -69, -68, -63, -62, -55, -51, -41, -32, -22, -20, -18, -17, -15, 0, 6, 10, 11, 21, 25, 34, 35, 42, 43, 45, 48, 55, 59, 78, 88, 89, 90, 109, 110, 112, 113, 115, 120, 123, 140, 148].","[-99, -98, -95, -92, -84, -83, -75, -69, -68, -63, -62, -55, -51, -41, -32, -22, -20, -18, -17, -15, 0, 6, 10, 11, 21, 25, 34, 35, 42, 43, 45, 48, 55, 59, 78, 88, 89, 90, 109, 110, 112, 113, 115, 120, 123, 140, 148], 27",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -20 in the following list: [-89, 12, 24, 37, 139].","[-89, 12, 24, 37, 139], -20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -35 in the array [-79, -46, -21, -13, 14, 35, 56, 66, 95, 96, 100, 113, 127, 141, 142].","[-79, -46, -21, -13, 14, 35, 56, 66, 95, 96, 100, 113, 127, 141, 142], -35",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -45 in the array [-97, -94, -88, -85, -76, -71, -66, -55, -37, -34, -31, -29, -25, -23, 3, 8, 13, 14, 15, 26, 28, 29, 30, 35, 41, 50, 54, 59, 60, 63, 68, 72, 76, 77, 82, 84, 89, 102, 104, 111, 113, 115, 125, 131, 138, 140, 142, 149].","[-97, -94, -88, -85, -76, -71, -66, -55, -37, -34, -31, -29, -25, -23, 3, 8, 13, 14, 15, 26, 28, 29, 30, 35, 41, 50, 54, 59, 60, 63, 68, 72, 76, 77, 82, 84, 89, 102, 104, 111, 113, 115, 125, 131, 138, 140, 142, 149], -45",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 0 exists in [-90, -78, -30, 0, 5, 24, 30, 32, 34, 37, 40, 42, 51, 72, 83, 96].","[-90, -78, -30, 0, 5, 24, 30, 32, 34, 37, 40, 42, 51, 72, 83, 96], 0",Element found at index 3,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 63 in the array [-93, -84, -80, -70, -67, -62, -61, -55, -45, -43, -42, -37, -32, -29, -26, -25, -11, -3, -2, 6, 8, 14, 18, 20, 22, 29, 52, 53, 58, 60, 67, 70, 74, 75, 76, 78, 91, 92, 95, 102, 124, 128, 130, 137, 140, 141, 142, 144, 148].","[-93, -84, -80, -70, -67, -62, -61, -55, -45, -43, -42, -37, -32, -29, -26, -25, -11, -3, -2, 6, 8, 14, 18, 20, 22, 29, 52, 53, 58, 60, 67, 70, 74, 75, 76, 78, 91, 92, 95, 102, 124, 128, 130, 137, 140, 141, 142, 144, 148], 63",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -33 exists in [-96, -92, -82, -66, -47, -39, -23, -16, -7, 1, 57, 63, 75, 80].","[-96, -92, -82, -66, -47, -39, -23, -16, -7, 1, 57, 63, 75, 80], -33",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 40 appear in [-92, -88, -84, -74, -73, -72, -55, -48, -41, -31, -26, -14, -9, 8, 15, 37, 38, 58, 63, 67, 86, 94, 112, 120, 134, 135, 140]? Use linear search to check.","[-92, -88, -84, -74, -73, -72, -55, -48, -41, -31, -26, -14, -9, 8, 15, 37, 38, 58, 63, 67, 86, 94, 112, 120, 134, 135, 140], 40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 24 exists in [-71, -70, 25, 28, 38, 81, 104, 128].","[-71, -70, 25, 28, 38, 81, 104, 128], 24",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -7 exists in [-93, -64, -43, -40, -36, -31, -29, -9, 24, 71, 75, 81, 82, 116, 149].","[-93, -64, -43, -40, -36, -31, -29, -9, 24, 71, 75, 81, 82, 116, 149], -7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 68 in the list [-92, -87, -85, -80, -71, -70, -68, -67, -64, -63, -62, -56, -55, -45, -44, -36, -32, -22, -17, -9, -3, 4, 9, 10, 20, 21, 27, 29, 41, 54, 71, 76, 84, 93, 99, 102, 115, 128, 134, 136, 140, 145, 148].","[-92, -87, -85, -80, -71, -70, -68, -67, -64, -63, -62, -56, -55, -45, -44, -36, -32, -22, -17, -9, -3, 4, 9, 10, 20, 21, 27, 29, 41, 54, 71, 76, 84, 93, 99, 102, 115, 128, 134, 136, 140, 145, 148], 68",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 14 in the list [-100, -91, -89, -85, -83, -70, -65, -61, -59, -54, -38, -31, -28, -23, -16, -13, -6, -4, 4, 6, 7, 12, 13, 15, 25, 28, 40, 53, 58, 66, 71, 74, 78, 79, 82, 84, 87, 89, 92, 93, 100, 108, 117, 122, 127, 130, 135, 140, 146, 147].","[-100, -91, -89, -85, -83, -70, -65, -61, -59, -54, -38, -31, -28, -23, -16, -13, -6, -4, 4, 6, 7, 12, 13, 15, 25, 28, 40, 53, 58, 66, 71, 74, 78, 79, 82, 84, 87, 89, 92, 93, 100, 108, 117, 122, 127, 130, 135, 140, 146, 147], 14",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -3 in the array [-98, -90, -77, -60, -54, -44, -43, -38, -21, -9, -2, -1, 5, 7, 22, 24, 26, 28, 30, 34, 43, 48, 50, 70, 72, 74, 75, 79, 87, 89, 100, 102, 106, 115, 120, 125, 129, 138, 142, 146].","[-98, -90, -77, -60, -54, -44, -43, -38, -21, -9, -2, -1, 5, 7, 22, 24, 26, 28, 30, 34, 43, 48, 50, 70, 72, 74, 75, 79, 87, 89, 100, 102, 106, 115, 120, 125, 129, 138, 142, 146], -3",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 14 in the list [-83, -63, -28, -1, 6, 66, 102, 112].","[-83, -63, -28, -1, 6, 66, 102, 112], 14",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -17 exists in [-99, -97, -91, -86, -77, -57, -49, -47, -42, -32, -27, -17, -12, -10, -8, -2, -1, 4, 14, 15, 16, 18, 20, 28, 34, 35, 61, 69, 71, 77, 79, 81, 84, 90, 108, 130, 134, 138].","[-99, -97, -91, -86, -77, -57, -49, -47, -42, -32, -27, -17, -12, -10, -8, -2, -1, 4, 14, 15, 16, 18, 20, 28, 34, 35, 61, 69, 71, 77, 79, 81, 84, 90, 108, 130, 134, 138], -17",Element found at index 11,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 57 in the following list: [-99, -94, -90, -86, -76, -70, -65, -50, -45, -43, -41, -33, -26, -25, -23, -20, -17, -15, 5, 6, 11, 21, 22, 23, 24, 28, 39, 42, 48, 50, 52, 69, 73, 80, 83, 88, 95, 104, 117, 119, 130, 132, 148].","[-99, -94, -90, -86, -76, -70, -65, -50, -45, -43, -41, -33, -26, -25, -23, -20, -17, -15, 5, 6, 11, 21, 22, 23, 24, 28, 39, 42, 48, 50, 52, 69, 73, 80, 83, 88, 95, 104, 117, 119, 130, 132, 148], 57",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 36 in the array [-90, -72, -9, 2, 11, 38, 43, 76, 104, 109, 131, 141, 142].","[-90, -72, -9, 2, 11, 38, 43, 76, 104, 109, 131, 141, 142], 36",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 71 in the array [-98, -94, -84, -82, -80, -78, -69, -65, -63, -48, -39, -35, -25, -18, -10, -7, -4, 34, 35, 43, 44, 57, 67, 72, 74, 77, 82, 87, 88, 89, 92, 102, 111, 112, 113, 117, 118, 119, 124, 126, 138, 139, 140, 145].","[-98, -94, -84, -82, -80, -78, -69, -65, -63, -48, -39, -35, -25, -18, -10, -7, -4, 34, 35, 43, 44, 57, 67, 72, 74, 77, 82, 87, 88, 89, 92, 102, 111, 112, 113, 117, 118, 119, 124, 126, 138, 139, 140, 145], 71",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 71 in the list [-89, -87, -83, -69, -66, -60, -42, -41, -36, -30, -20, -18, -15, -14, -2, -1, 3, 7, 11, 14, 23, 30, 31, 55, 58, 65, 69, 71, 75, 76, 79, 80, 85, 93, 109, 117, 118, 124, 129, 136].","[-89, -87, -83, -69, -66, -60, -42, -41, -36, -30, -20, -18, -15, -14, -2, -1, 3, 7, 11, 14, 23, 30, 31, 55, 58, 65, 69, 71, 75, 76, 79, 80, 85, 93, 109, 117, 118, 124, 129, 136], 71",Element found at index 27,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -7 in the array [-85, 14, 47, 73, 82].","[-85, 14, 47, 73, 82], -7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 2 exists in [-99, -93, -89, -83, -78, -56, -50, -30, -9, 11, 15, 16, 23, 75, 82, 86, 115, 129].","[-99, -93, -89, -83, -78, -56, -50, -30, -9, 11, 15, 16, 23, 75, 82, 86, 115, 129], 2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 26 in the array [-86, -75, -67, -65, -62, -55, -48, -46, -44, -36, -33, -30, -29, -19, -17, -12, 2, 7, 8, 16, 26, 29, 32, 43, 57, 68, 73, 78, 83, 88, 89, 103, 113, 115, 116, 128, 135, 141, 145].","[-86, -75, -67, -65, -62, -55, -48, -46, -44, -36, -33, -30, -29, -19, -17, -12, 2, 7, 8, 16, 26, 29, 32, 43, 57, 68, 73, 78, 83, 88, 89, 103, 113, 115, 116, 128, 135, 141, 145], 26",Element found at index 20,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 77 appear in [-72, -12, 32, 58, 136, 137]? Use linear search to check.","[-72, -12, 32, 58, 136, 137], 77",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 2 in the array [-87, -67, -66, -17, -15, -4, 1, 3, 13, 14, 17, 30, 44, 47, 51, 52, 55, 92, 101, 118].","[-87, -67, -66, -17, -15, -4, 1, 3, 13, 14, 17, 30, 44, 47, 51, 52, 55, 92, 101, 118], 2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -43 in the list [-97, -85, -84, -77, -68, -63, -5, -4, 31, 42, 58, 59, 84, 86, 92, 101, 114].","[-97, -85, -84, -77, -68, -63, -5, -4, 31, 42, 58, 59, 84, 86, 92, 101, 114], -43",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 100 in the list [-80, -77, -52, -35, -25, -22, -15, 10, 15, 50, 58, 60, 104, 113, 127, 143].","[-80, -77, -52, -35, -25, -22, -15, 10, 15, 50, 58, 60, 104, 113, 127, 143], 100",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 49 in the list [-86, -77, -58, -56, -53, -52, -37, -23, -18, -12, -8, -5, -3, 3, 7, 28, 36, 45, 54, 58, 61, 64, 65, 66, 67, 70, 71, 72, 92, 104, 112, 127, 141].","[-86, -77, -58, -56, -53, -52, -37, -23, -18, -12, -8, -5, -3, 3, 7, 28, 36, 45, 54, 58, 61, 64, 65, 66, 67, 70, 71, 72, 92, 104, 112, 127, 141], 49",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 91 in the following list: [-90, -70, -68, -63, -62, -60, -58, -45, -44, -42, -33, -30, -13, 2, 18, 23, 27, 33, 54, 64, 72, 90, 94, 97, 117].","[-90, -70, -68, -63, -62, -60, -58, -45, -44, -42, -33, -30, -13, 2, 18, 23, 27, 33, 54, 64, 72, 90, 94, 97, 117], 91",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 91 in the list [-79, -62, -22, -15, 42, 61, 72, 73].","[-79, -62, -22, -15, 42, 61, 72, 73], 91",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -15 in the following list: [-95, -93, -89, -86, -81, -75, -52, -50, -48, -47, -37, -34, -30, -29, -23, -19, -11, -6, -3, 22, 26, 38, 43, 46, 52, 57, 60, 75, 78, 89, 92, 110, 111, 115, 125, 128, 130, 135, 142].","[-95, -93, -89, -86, -81, -75, -52, -50, -48, -47, -37, -34, -30, -29, -23, -19, -11, -6, -3, 22, 26, 38, 43, 46, 52, 57, 60, 75, 78, 89, 92, 110, 111, 115, 125, 128, 130, 135, 142], -15",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -44 in the array [-89, -87, -65, -51, -15, -13, 2, 17, 23, 35, 36, 44, 50, 57, 84, 86, 112, 119, 134, 145].","[-89, -87, -65, -51, -15, -13, 2, 17, 23, 35, 36, 44, 50, 57, 84, 86, 112, 119, 134, 145], -44",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 72 exists in [-71, -56, 9, 35, 45, 72].","[-71, -56, 9, 35, 45, 72], 72",Element found at index 5,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 40 exists in [-98, -75, -65, -59, -47, -40, -39, -37, -28, -27, -25, -13, -7, -2, 4, 7, 21, 23, 26, 32, 34, 38, 49, 57, 62, 68, 77, 80, 92, 96].","[-98, -75, -65, -59, -47, -40, -39, -37, -28, -27, -25, -13, -7, -2, 4, 7, 21, 23, 26, 32, 34, 38, 49, 57, 62, 68, 77, 80, 92, 96], 40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 76 exists in [-100, -88, -85, -80, -79, -72, -71, -65, -46, -32, -30, -13, -8, -7, -2, 0, 3, 11, 18, 24, 30, 34, 42, 46, 47, 64, 80, 92, 105, 109, 110, 116, 127, 130].","[-100, -88, -85, -80, -79, -72, -71, -65, -46, -32, -30, -13, -8, -7, -2, 0, 3, 11, 18, 24, 30, 34, 42, 46, 47, 64, 80, 92, 105, 109, 110, 116, 127, 130], 76",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 100 in the following list: [-99, -95, -94, -88, -78, -72, -71, -63, -59, -49, -44, -41, -37, -34, -28, -27, -14, -10, 8, 14, 15, 26, 27, 28, 31, 46, 47, 57, 64, 70, 73, 80, 81, 85, 87, 88, 113, 116, 119, 123, 125, 132, 140, 143, 149].","[-99, -95, -94, -88, -78, -72, -71, -63, -59, -49, -44, -41, -37, -34, -28, -27, -14, -10, 8, 14, 15, 26, 27, 28, 31, 46, 47, 57, 64, 70, 73, 80, 81, 85, 87, 88, 113, 116, 119, 123, 125, 132, 140, 143, 149], 100",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 5 in the following list: [-64, -59, -11, -8, 50, 57, 59, 69, 70, 80, 83, 88, 94, 112, 135, 147, 149].","[-64, -59, -11, -8, 50, 57, 59, 69, 70, 80, 83, 88, 94, 112, 135, 147, 149], 5",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -12 in the list [-95, -90, -87, -86, -85, -75, -65, -60, -55, -49, -48, -42, -38, -31, -30, -27, -24, -18, -17, -12, -8, 2, 8, 9, 17, 20, 23, 24, 40, 41, 49, 54, 57, 58, 62, 63, 66, 72, 74, 80, 91, 92, 99, 101, 109, 126, 139, 145, 147].","[-95, -90, -87, -86, -85, -75, -65, -60, -55, -49, -48, -42, -38, -31, -30, -27, -24, -18, -17, -12, -8, 2, 8, 9, 17, 20, 23, 24, 40, 41, 49, 54, 57, 58, 62, 63, 66, 72, 74, 80, 91, 92, 99, 101, 109, 126, 139, 145, 147], -12",Element found at index 19,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 19 exists in [-96, -88, -85, -73, -67, -54, -46, -45, -43, -34, -22, -21, -20, -15, -8, -5, 0, 5, 7, 14, 17, 19, 30, 34, 35, 45, 47, 53, 60, 61, 65, 69, 75, 77, 78, 89, 90, 91, 98, 105, 114, 120, 121, 126, 146, 149].","[-96, -88, -85, -73, -67, -54, -46, -45, -43, -34, -22, -21, -20, -15, -8, -5, 0, 5, 7, 14, 17, 19, 30, 34, 35, 45, 47, 53, 60, 61, 65, 69, 75, 77, 78, 89, 90, 91, 98, 105, 114, 120, 121, 126, 146, 149], 19",Element found at index 21,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 83 appear in [-95, -85, -53, -39, -26, -9, -4, 3, 17, 27, 35, 54, 55, 73, 83, 91, 104, 124, 130, 147, 148, 149]? Use linear search to check.","[-95, -85, -53, -39, -26, -9, -4, 3, 17, 27, 35, 54, 55, 73, 83, 91, 104, 124, 130, 147, 148, 149], 83",Element found at index 14,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 1 exists in [-98, -80, -68, -47, -45, -24, -2, 25, 35, 45, 65, 74, 83, 84, 90, 94, 95, 122, 128, 139, 142, 149].","[-98, -80, -68, -47, -45, -24, -2, 25, 35, 45, 65, 74, 83, 84, 90, 94, 95, 122, 128, 139, 142, 149], 1",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -41 exists in [-75, -51, -46, -34, -32, -16, -11, 0, 1, 24, 32, 64, 107, 121, 127, 135, 144].","[-75, -51, -46, -34, -32, -16, -11, 0, 1, 24, 32, 64, 107, 121, 127, 135, 144], -41",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -39 in the following list: [-98, -91, -86, -77, -76, -75, -72, -71, -48, -41, -39, -35, -24, -13, -12, 14, 21, 35, 41, 45, 54, 57, 60, 65, 74, 78, 84, 85, 104, 112, 119, 121, 126, 141, 145, 147].","[-98, -91, -86, -77, -76, -75, -72, -71, -48, -41, -39, -35, -24, -13, -12, 14, 21, 35, 41, 45, 54, 57, 60, 65, 74, 78, 84, 85, 104, 112, 119, 121, 126, 141, 145, 147], -39",Element found at index 10,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -20 appear in [-97, -93, -81, -80, -75, -72, -69, -67, -35, -27, -19, -18, -17, -13, -11, -4, 5, 6, 19, 20, 24, 26, 28, 29, 30, 35, 37, 38, 48, 55, 58, 61, 62, 71, 72, 99, 101, 105, 115, 120, 122, 124, 132, 136, 139, 140, 141]? Use linear search to check.","[-97, -93, -81, -80, -75, -72, -69, -67, -35, -27, -19, -18, -17, -13, -11, -4, 5, 6, 19, 20, 24, 26, 28, 29, 30, 35, 37, 38, 48, 55, 58, 61, 62, 71, 72, 99, 101, 105, 115, 120, 122, 124, 132, 136, 139, 140, 141], -20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 32 in the array [-99, -87, -85, -80, -79, -77, -75, -41, -35, 0, 13, 37, 38, 61, 67, 71, 79, 91, 95, 96, 104, 108, 113, 114, 128, 139].","[-99, -87, -85, -80, -79, -77, -75, -41, -35, 0, 13, 37, 38, 61, 67, 71, 79, 91, 95, 96, 104, 108, 113, 114, 128, 139], 32",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 19 in the following list: [-93, -92, -90, -87, -86, -70, -69, -58, -44, -37, -30, -27, -26, -24, -22, -13, -6, 1, 6, 12, 15, 25, 26, 43, 57, 63, 66, 88, 97, 102, 109, 114, 115, 121, 135, 142, 144].","[-93, -92, -90, -87, -86, -70, -69, -58, -44, -37, -30, -27, -26, -24, -22, -13, -6, 1, 6, 12, 15, 25, 26, 43, 57, 63, 66, 88, 97, 102, 109, 114, 115, 121, 135, 142, 144], 19",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 100 appear in [-82, -72, -49, -12, -8, -5, 1, 10, 30, 57, 62, 65, 74, 83, 103, 109, 111, 118, 119, 122, 143, 148]? Use linear search to check.","[-82, -72, -49, -12, -8, -5, 1, 10, 30, 57, 62, 65, 74, 83, 103, 109, 111, 118, 119, 122, 143, 148], 100",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 72 in the following list: [-94, -85, -74, -72, -37, -20, -19, -11, 2, 22, 77, 84, 101, 124, 135].","[-94, -85, -74, -72, -37, -20, -19, -11, 2, 22, 77, 84, 101, 124, 135], 72",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 56 appear in [-94, -93, -89, -87, -84, -81, -74, -70, -58, -53, -45, -39, -36, -14, -11, -9, -4, -3, -2, 1, 2, 3, 5, 11, 25, 31, 32, 37, 38, 41, 42, 46, 49, 56, 67, 68, 78, 86, 88, 90, 92, 93, 101, 104, 107, 117, 128, 129, 148, 149]? Use linear search to check.","[-94, -93, -89, -87, -84, -81, -74, -70, -58, -53, -45, -39, -36, -14, -11, -9, -4, -3, -2, 1, 2, 3, 5, 11, 25, 31, 32, 37, 38, 41, 42, 46, 49, 56, 67, 68, 78, 86, 88, 90, 92, 93, 101, 104, 107, 117, 128, 129, 148, 149], 56",Element found at index 33,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 97 in the list [-99, -84, -76, -63, -62, -50, -46, -19, -13, -12, -11, -8, 0, 3, 10, 11, 15, 17, 20, 26, 29, 30, 36, 41, 43, 55, 59, 64, 67, 68, 86, 88, 92, 96, 110, 116, 121, 129, 132, 133].","[-99, -84, -76, -63, -62, -50, -46, -19, -13, -12, -11, -8, 0, 3, 10, 11, 15, 17, 20, 26, 29, 30, 36, 41, 43, 55, 59, 64, 67, 68, 86, 88, 92, 96, 110, 116, 121, 129, 132, 133], 97",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 24 in the list [-98, -94, -84, -75, -66, -59, -55, -44, -36, -34, -31, -9, -4, 7, 10, 18, 24, 27, 33, 35, 36, 49, 54, 56, 58, 60, 61, 67, 70, 91, 94, 101, 103, 106, 109, 115, 116, 118, 120, 122].","[-98, -94, -84, -75, -66, -59, -55, -44, -36, -34, -31, -9, -4, 7, 10, 18, 24, 27, 33, 35, 36, 49, 54, 56, 58, 60, 61, 67, 70, 91, 94, 101, 103, 106, 109, 115, 116, 118, 120, 122], 24",Element found at index 16,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 83 exists in [-88, -84, -69, -66, -12, 16, 23, 25, 47, 53, 55, 56, 72, 82, 109, 113, 117, 134, 149].","[-88, -84, -69, -66, -12, 16, 23, 25, 47, 53, 55, 56, 72, 82, 109, 113, 117, 134, 149], 83",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -2 in the array [-75, -66, -6, 20, 23, 91, 104, 138].","[-75, -66, -6, 20, 23, 91, 104, 138], -2",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 89 in the list [-99, -96, -94, -93, -87, -83, -79, -71, -68, -65, -61, -57, -50, -44, -24, -20, -15, -14, -10, -5, 11, 12, 16, 17, 24, 28, 29, 32, 40, 48, 59, 87, 88, 92, 105, 106, 113, 141].","[-99, -96, -94, -93, -87, -83, -79, -71, -68, -65, -61, -57, -50, -44, -24, -20, -15, -14, -10, -5, 11, 12, 16, 17, 24, 28, 29, 32, 40, 48, 59, 87, 88, 92, 105, 106, 113, 141], 89",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 66 in the list [-100, -89, -85, -77, -72, -56, -54, -50, -40, -35, -27, -22, -16, -8, 3, 15, 18, 20, 25, 26, 27, 28, 35, 37, 49, 64, 65, 66, 70, 72, 73, 76, 79, 92, 99, 109, 114, 115, 119, 125, 128, 129, 134, 137, 140, 142].","[-100, -89, -85, -77, -72, -56, -54, -50, -40, -35, -27, -22, -16, -8, 3, 15, 18, 20, 25, 26, 27, 28, 35, 37, 49, 64, 65, 66, 70, 72, 73, 76, 79, 92, 99, 109, 114, 115, 119, 125, 128, 129, 134, 137, 140, 142], 66",Element found at index 27,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 13 exists in [-62, -50, -42, -36, -19, -4, 19, 30, 42, 65, 67, 70, 83, 144].","[-62, -50, -42, -36, -19, -4, 19, 30, 42, 65, 67, 70, 83, 144], 13",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 74 exists in [-94, -88, -84, -57, -52, -36, -25, -23, -15, -12, -7, -2, 11, 16, 21, 31, 33, 51, 53, 61, 70, 75, 95, 107, 109, 115, 143, 144].","[-94, -88, -84, -57, -52, -36, -25, -23, -15, -12, -7, -2, 11, 16, 21, 31, 33, 51, 53, 61, 70, 75, 95, 107, 109, 115, 143, 144], 74",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 64 in the following list: [-100, -98, -91, -47, -19, 51, 97].","[-100, -98, -91, -47, -19, 51, 97], 64",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 98 in the array [-96, -91, -82, -68, -66, -63, -54, -47, -45, -42, -41, -31, -28, -27, -9, -7, 0, 6, 12, 23, 29, 34, 41, 44, 45, 51, 52, 70, 71, 77, 80, 82, 84, 90, 93, 99, 103, 121, 135, 145, 146].","[-96, -91, -82, -68, -66, -63, -54, -47, -45, -42, -41, -31, -28, -27, -9, -7, 0, 6, 12, 23, 29, 34, 41, 44, 45, 51, 52, 70, 71, 77, 80, 82, 84, 90, 93, 99, 103, 121, 135, 145, 146], 98",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 45 in the list [-82, 55, 78, 127, 129].","[-82, 55, 78, 127, 129], 45",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 9 exists in [-90, -79, -75, -73, -69, -64, -60, -59, -58, -53, -52, -49, -39, -36, -34, -25, -18, -17, -15, -13, -11, -8, -3, 12, 19, 36, 47, 49, 50, 51, 54, 61, 62, 70, 71, 76, 77, 85, 87, 94, 106, 108, 110, 115, 123, 134, 140, 143, 144, 148].","[-90, -79, -75, -73, -69, -64, -60, -59, -58, -53, -52, -49, -39, -36, -34, -25, -18, -17, -15, -13, -11, -8, -3, 12, 19, 36, 47, 49, 50, 51, 54, 61, 62, 70, 71, 76, 77, 85, 87, 94, 106, 108, 110, 115, 123, 134, 140, 143, 144, 148], 9",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 25 in the array [-86, -82, -79, -73, -66, -64, -52, -41, -11, -5, 5, 53, 70, 72, 79, 93, 96, 109, 112, 115, 138, 140].","[-86, -82, -79, -73, -66, -64, -52, -41, -11, -5, 5, 53, 70, 72, 79, 93, 96, 109, 112, 115, 138, 140], 25",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 12 exists in [-92, -45, -11, 15, 24, 30, 50, 53, 61, 63, 82, 113, 120, 132, 133, 134].","[-92, -45, -11, 15, 24, 30, 50, 53, 61, 63, 82, 113, 120, 132, 133, 134], 12",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 51 appear in [-87, -84, -78, -59, -52, -49, -47, -45, -30, -21, -16, -13, 9, 18, 30, 44, 45, 49, 50, 70, 84, 91, 96, 103, 105, 115, 127, 134, 139]? Use linear search to check.","[-87, -84, -78, -59, -52, -49, -47, -45, -30, -21, -16, -13, 9, 18, 30, 44, 45, 49, 50, 70, 84, 91, 96, 103, 105, 115, 127, 134, 139], 51",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -11 exists in [-86, -79, -75, -70, -64, -56, -28, -18, -12, 3, 7, 42, 45, 47, 50, 62, 67, 73, 87, 91, 93, 94, 97, 100, 105, 106, 112, 128, 131, 142].","[-86, -79, -75, -70, -64, -56, -28, -18, -12, 3, 7, 42, 45, 47, 50, 62, 67, 73, 87, 91, 93, 94, 97, 100, 105, 106, 112, 128, 131, 142], -11",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 60 appear in [-100, -98, -95, -84, -81, -72, -71, -54, -53, -48, -37, -28, -14, -13, 6, 8, 18, 24, 39, 43, 46, 52, 54, 62, 72, 81, 83, 86, 88, 91, 97, 98, 106, 107, 116, 118, 135, 138, 140, 143, 147]? Use linear search to check.","[-100, -98, -95, -84, -81, -72, -71, -54, -53, -48, -37, -28, -14, -13, 6, 8, 18, 24, 39, 43, 46, 52, 54, 62, 72, 81, 83, 86, 88, 91, 97, 98, 106, 107, 116, 118, 135, 138, 140, 143, 147], 60",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 88 appear in [-93, -70, -54, -23, -1, 9, 10, 21, 23, 26, 27, 33, 34, 35, 36, 51, 53, 64, 67, 69, 70, 85, 87, 88, 92, 98, 104, 108, 118, 120, 128, 131, 138, 149]? Use linear search to check.","[-93, -70, -54, -23, -1, 9, 10, 21, 23, 26, 27, 33, 34, 35, 36, 51, 53, 64, 67, 69, 70, 85, 87, 88, 92, 98, 104, 108, 118, 120, 128, 131, 138, 149], 88",Element found at index 23,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -24 appear in [-86, -82, -80, -58, -32, -30, -13, -7, 22, 27, 38, 41, 49, 55, 59, 75, 77, 103, 132, 138]? Use linear search to check.","[-86, -82, -80, -58, -32, -30, -13, -7, 22, 27, 38, 41, 49, 55, 59, 75, 77, 103, 132, 138], -24",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 100 in the following list: [-96, -95, -68, -67, -63, -61, -57, -47, -44, -35, -26, -24, -20, -13, -7, 1, 4, 9, 14, 17, 26, 27, 28, 44, 52, 54, 55, 62, 64, 85, 91, 96, 110, 136, 144].","[-96, -95, -68, -67, -63, -61, -57, -47, -44, -35, -26, -24, -20, -13, -7, 1, 4, 9, 14, 17, 26, 27, 28, 44, 52, 54, 55, 62, 64, 85, 91, 96, 110, 136, 144], 100",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 41 exists in [-86, -84, -73, -71, -62, -51, -47, -46, -2, 1, 4, 5, 14, 18, 40, 71, 74, 77, 79, 82, 138, 140, 143, 149].","[-86, -84, -73, -71, -62, -51, -47, -46, -2, 1, 4, 5, 14, 18, 40, 71, 74, 77, 79, 82, 138, 140, 143, 149], 41",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -29 exists in [-94, -93, -91, -78, -77, -70, -67, -62, -61, -56, -43, -42, -37, -20, -16, 5, 12, 13, 22, 24, 28, 37, 43, 50, 52, 53, 64, 65, 67, 75, 79, 81, 85, 91, 92, 97, 115, 117, 123, 133, 134, 137, 143, 147].","[-94, -93, -91, -78, -77, -70, -67, -62, -61, -56, -43, -42, -37, -20, -16, 5, 12, 13, 22, 24, 28, 37, 43, 50, 52, 53, 64, 65, 67, 75, 79, 81, 85, 91, 92, 97, 115, 117, 123, 133, 134, 137, 143, 147], -29",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 33 in the list [-90, -87, -82, -65, -50, -44, -36, -35, -15, -4, 1, 20, 25, 26, 30, 31, 51, 68, 69, 73, 78, 85, 87, 94, 98, 104, 107, 119, 120, 126, 130, 144, 145, 147, 148].","[-90, -87, -82, -65, -50, -44, -36, -35, -15, -4, 1, 20, 25, 26, 30, 31, 51, 68, 69, 73, 78, 85, 87, 94, 98, 104, 107, 119, 120, 126, 130, 144, 145, 147, 148], 33",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 14 in the following list: [-99, -86, -84, -78, -46, 11, 102, 113, 116, 124, 143].","[-99, -86, -84, -78, -46, 11, 102, 113, 116, 124, 143], 14",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -31 in the array [-99, -77, -75, -66, -52, -43, -28, -21, -13, -10, -5, 11, 24, 55, 69, 92, 117, 144].","[-99, -77, -75, -66, -52, -43, -28, -21, -13, -10, -5, 11, 24, 55, 69, 92, 117, 144], -31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 93 in the following list: [-18, 38, 80, 85, 93, 105].","[-18, 38, 80, 85, 93, 105], 93",Element found at index 4,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 7 in the list [-72, -60, -44, -31, -26, 4, 35, 53, 96, 102, 108, 120, 145].","[-72, -60, -44, -31, -26, 4, 35, 53, 96, 102, 108, 120, 145], 7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 29 exists in [-90, -89, -72, -65, -63, -54, -45, -43, -42, -39, -38, -37, -35, -32, -30, -24, -15, -11, -6, -3, 3, 4, 5, 6, 12, 20, 29, 30, 31, 32, 37, 41, 56, 76, 86, 87, 90, 93, 102, 104, 105, 107, 110, 111, 112, 119, 120, 121, 131, 144].","[-90, -89, -72, -65, -63, -54, -45, -43, -42, -39, -38, -37, -35, -32, -30, -24, -15, -11, -6, -3, 3, 4, 5, 6, 12, 20, 29, 30, 31, 32, 37, 41, 56, 76, 86, 87, 90, 93, 102, 104, 105, 107, 110, 111, 112, 119, 120, 121, 131, 144], 29",Element found at index 26,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 44 appear in [-87, -86, -84, -80, -69, -67, -65, -62, -49, -43, -40, -27, -23, -8, -5, -4, -1, 11, 20, 28, 29, 30, 34, 44, 48, 54, 57, 64, 70, 76, 77, 82, 91, 99, 106, 109, 112, 123, 130, 133]? Use linear search to check.","[-87, -86, -84, -80, -69, -67, -65, -62, -49, -43, -40, -27, -23, -8, -5, -4, -1, 11, 20, 28, 29, 30, 34, 44, 48, 54, 57, 64, 70, 76, 77, 82, 91, 99, 106, 109, 112, 123, 130, 133], 44",Element found at index 23,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 51 appear in [-96, -92, -54, -33, -26, -22, -6, -2, 1, 7, 18, 19, 21, 30, 33, 34, 44, 53, 56, 92, 94, 99, 103, 124, 125, 130, 132, 141, 148]? Use linear search to check.","[-96, -92, -54, -33, -26, -22, -6, -2, 1, 7, 18, 19, 21, 30, 33, 34, 44, 53, 56, 92, 94, 99, 103, 124, 125, 130, 132, 141, 148], 51",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -7 in the list [-87, -85, -79, -61, -60, -55, -54, -36, -28, -20, -16, -8, 0, 10, 21, 28, 34, 39, 45, 58, 59, 61, 62, 64, 68, 75, 83, 86, 93, 98, 99, 107, 111, 112, 131, 143].","[-87, -85, -79, -61, -60, -55, -54, -36, -28, -20, -16, -8, 0, 10, 21, 28, 34, 39, 45, 58, 59, 61, 62, 64, 68, 75, 83, 86, 93, 98, 99, 107, 111, 112, 131, 143], -7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 99 exists in [-100, -99, -97, -96, -88, -87, -86, -78, -77, -76, -74, -71, -70, -67, -47, -45, -43, -26, -22, -7, -6, 2, 8, 12, 22, 24, 35, 36, 39, 46, 49, 50, 65, 72, 86, 87, 94, 96, 97, 100, 101, 104, 109, 115, 122, 130, 132, 143, 144].","[-100, -99, -97, -96, -88, -87, -86, -78, -77, -76, -74, -71, -70, -67, -47, -45, -43, -26, -22, -7, -6, 2, 8, 12, 22, 24, 35, 36, 39, 46, 49, 50, 65, 72, 86, 87, 94, 96, 97, 100, 101, 104, 109, 115, 122, 130, 132, 143, 144], 99",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -38 in the list [-92, -86, -71, -60, -36, -27, -22, -21, -17, -11, -6, -5, -3, 22, 34, 40, 41, 45, 52, 53, 55, 57, 58, 59, 60, 73, 77, 81, 86, 88, 97, 98, 104, 115, 118, 120, 122, 127, 129, 131, 132, 133, 138, 139, 140, 143, 145, 148].","[-92, -86, -71, -60, -36, -27, -22, -21, -17, -11, -6, -5, -3, 22, 34, 40, 41, 45, 52, 53, 55, 57, 58, 59, 60, 73, 77, 81, 86, 88, 97, 98, 104, 115, 118, 120, 122, 127, 129, 131, 132, 133, 138, 139, 140, 143, 145, 148], -38",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 86 appear in [-96, -52, -24, -15, 4, 6, 25, 35, 42, 58, 64, 69, 72, 107, 108, 127, 140]? Use linear search to check.","[-96, -52, -24, -15, 4, 6, 25, 35, 42, 58, 64, 69, 72, 107, 108, 127, 140], 86",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -45 in the list [-95, -91, -90, -87, -82, -72, -61, -56, -46, -39, -14, -8, -3, -1, 5, 7, 19, 28, 29, 36, 37, 41, 46, 52, 54, 57, 59, 68, 72, 81, 82, 87, 91, 92, 99, 104, 109, 110, 115, 116, 123, 140, 147].","[-95, -91, -90, -87, -82, -72, -61, -56, -46, -39, -14, -8, -3, -1, 5, 7, 19, 28, 29, 36, 37, 41, 46, 52, 54, 57, 59, 68, 72, 81, 82, 87, 91, 92, 99, 104, 109, 110, 115, 116, 123, 140, 147], -45",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -36 exists in [-88, -86, -85, -73, -71, -58, -51, -49, -31, -24, -21, -17, 0, 9, 17, 18, 26, 28, 53, 56, 67, 78, 93, 95, 98, 99, 123, 124, 133, 143].","[-88, -86, -85, -73, -71, -58, -51, -49, -31, -24, -21, -17, 0, 9, 17, 18, 26, 28, 53, 56, 67, 78, 93, 95, 98, 99, 123, 124, 133, 143], -36",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -47 appear in [-94, -92, -78, -67, -57, -51, -33, -32, -8, -7, -5, 6, 12, 16, 25, 26, 28, 31, 38, 42, 43, 47, 56, 66, 69, 81, 82, 88, 107, 112, 119, 122, 131]? Use linear search to check.","[-94, -92, -78, -67, -57, -51, -33, -32, -8, -7, -5, 6, 12, 16, 25, 26, 28, 31, 38, 42, 43, 47, 56, 66, 69, 81, 82, 88, 107, 112, 119, 122, 131], -47",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 62 exists in [-85, -81, -58, -56, -51, -36, -31, -23, -20, -14, -9, -5, 1, 2, 3, 12, 13, 17, 23, 34, 38, 40, 45, 55, 60, 62, 67, 69, 74, 75, 86, 88, 92, 95, 109, 111, 113, 116, 119, 131, 134, 136].","[-85, -81, -58, -56, -51, -36, -31, -23, -20, -14, -9, -5, 1, 2, 3, 12, 13, 17, 23, 34, 38, 40, 45, 55, 60, 62, 67, 69, 74, 75, 86, 88, 92, 95, 109, 111, 113, 116, 119, 131, 134, 136], 62",Element found at index 25,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 61 in the following list: [-10, 17, 75, 121, 132].","[-10, 17, 75, 121, 132], 61",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 77 exists in [-63, -54, -47, -39, -37, 17, 27, 123].","[-63, -54, -47, -39, -37, 17, 27, 123], 77",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 32 in the list [-83, -76, -71, -67, -60, -59, -50, -30, -29, 8, 20, 49, 80, 89, 112, 126].","[-83, -76, -71, -67, -60, -59, -50, -30, -29, 8, 20, 49, 80, 89, 112, 126], 32",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -38 in the list [-100, -99, -98, -92, -91, -83, -79, -76, -71, -68, -65, -61, -48, -44, -42, -37, -36, -31, -27, -14, -11, 8, 18, 30, 32, 45, 49, 53, 64, 69, 73, 78, 80, 82, 84, 87, 106, 108, 110, 113, 125, 132, 145].","[-100, -99, -98, -92, -91, -83, -79, -76, -71, -68, -65, -61, -48, -44, -42, -37, -36, -31, -27, -14, -11, 8, 18, 30, 32, 45, 49, 53, 64, 69, 73, 78, 80, 82, 84, 87, 106, 108, 110, 113, 125, 132, 145], -38",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -21 in the following list: [-92, -85, -83, -75, -73, -71, -53, -40, -31, -25, -23, -15, -10, -3, 6, 7, 8, 12, 16, 19, 28, 33, 50, 65, 70, 71, 73, 77, 79, 83, 91, 99, 108, 112, 113, 129, 135, 137, 141, 142].","[-92, -85, -83, -75, -73, -71, -53, -40, -31, -25, -23, -15, -10, -3, 6, 7, 8, 12, 16, 19, 28, 33, 50, 65, 70, 71, 73, 77, 79, 83, 91, 99, 108, 112, 113, 129, 135, 137, 141, 142], -21",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 14 in the list [-92, -69, -67, -64, -58, -54, -50, -46, -30, -29, -24, 0, 15, 19, 26, 33, 35, 39, 44, 48, 49, 65, 67, 77, 81, 85, 87, 89, 91, 114, 123, 128, 134, 135, 141, 145, 147].","[-92, -69, -67, -64, -58, -54, -50, -46, -30, -29, -24, 0, 15, 19, 26, 33, 35, 39, 44, 48, 49, 65, 67, 77, 81, 85, 87, 89, 91, 114, 123, 128, 134, 135, 141, 145, 147], 14",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 99 in the list [-95, -84, -68, -67, -52, -27, -23, -18, -6, -1, 11, 12, 60, 66, 79, 94, 141].","[-95, -84, -68, -67, -52, -27, -23, -18, -6, -1, 11, 12, 60, 66, 79, 94, 141], 99",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 92 in the following list: [-91, -83, -72, -69, -64, -63, -62, -56, -50, -49, -33, -27, -20, -13, -12, -11, -9, -8, -5, -3, 18, 19, 20, 28, 39, 41, 58, 60, 81, 95, 101, 102, 105, 108, 111, 112, 113, 118, 132].","[-91, -83, -72, -69, -64, -63, -62, -56, -50, -49, -33, -27, -20, -13, -12, -11, -9, -8, -5, -3, 18, 19, 20, 28, 39, 41, 58, 60, 81, 95, 101, 102, 105, 108, 111, 112, 113, 118, 132], 92",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 82 in the array [-100, -85, -79, -69, -60, -52, -44, -42, -33, -29, 5, 15, 17, 18, 19, 35, 39, 40, 54, 63, 64, 65, 77, 84, 91, 99, 107, 128, 148].","[-100, -85, -79, -69, -60, -52, -44, -42, -33, -29, 5, 15, 17, 18, 19, 35, 39, 40, 54, 63, 64, 65, 77, 84, 91, 99, 107, 128, 148], 82",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 97 in the list [-80, -77, -47, -28, -6, 4, 10, 22, 60, 66, 83, 85, 86, 90, 95, 96, 98, 100, 119, 135, 136].","[-80, -77, -47, -28, -6, 4, 10, 22, 60, 66, 83, 85, 86, 90, 95, 96, 98, 100, 119, 135, 136], 97",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -35 exists in [-81, -51, -18, -17, -5, 3, 45, 53, 134].","[-81, -51, -18, -17, -5, 3, 45, 53, 134], -35",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 29 in the following list: [-97, -95, -65, -57, -52, -36, -1, 1, 2, 14, 34, 49, 62, 76, 83, 84, 105, 115].","[-97, -95, -65, -57, -52, -36, -1, 1, 2, 14, 34, 49, 62, 76, 83, 84, 105, 115], 29",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 17 exists in [-98, -92, -75, -59, -49, -45, -40, -36, -29, -11, -9, -7, 1, 3, 4, 5, 7, 13, 17, 25, 30, 39, 41, 44, 46, 49, 53, 55, 59, 70, 71, 76, 78, 94, 98, 101, 109, 116, 121, 125, 140].","[-98, -92, -75, -59, -49, -45, -40, -36, -29, -11, -9, -7, 1, 3, 4, 5, 7, 13, 17, 25, 30, 39, 41, 44, 46, 49, 53, 55, 59, 70, 71, 76, 78, 94, 98, 101, 109, 116, 121, 125, 140], 17",Element found at index 18,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 44 in the following list: [-98, -34, 4, 29, 45, 74, 88, 90, 104, 105, 111, 135, 137].","[-98, -34, 4, 29, 45, 74, 88, 90, 104, 105, 111, 135, 137], 44",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -49 in the following list: [-90, -88, -87, -49, -48, -28, 4, 8, 31, 34, 83, 89, 102, 104, 108].","[-90, -88, -87, -49, -48, -28, 4, 8, 31, 34, 83, 89, 102, 104, 108], -49",Element found at index 3,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 73 appear in [-93, -90, -87, -84, -78, -77, -75, -37, -32, 2, 13, 17, 49, 50, 60, 77, 88, 109, 127, 129, 139, 141]? Use linear search to check.","[-93, -90, -87, -84, -78, -77, -75, -37, -32, 2, 13, 17, 49, 50, 60, 77, 88, 109, 127, 129, 139, 141], 73",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 5 exists in [-98, -83, -80, -73, -70, -62, -55, -54, -33, -26, -19, -18, -10, 4, 5, 9, 18, 24, 33, 38, 41, 46, 52, 61, 74, 77, 85, 116, 118, 128, 129, 147].","[-98, -83, -80, -73, -70, -62, -55, -54, -33, -26, -19, -18, -10, 4, 5, 9, 18, 24, 33, 38, 41, 46, 52, 61, 74, 77, 85, 116, 118, 128, 129, 147], 5",Element found at index 14,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 66 exists in [-96, -66, -57, 25, 41, 42, 73, 134].","[-96, -66, -57, 25, 41, 42, 73, 134], 66",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 34 appear in [-91, -88, -82, -81, -68, -63, -61, -43, -38, -36, -31, -29, -23, -20, -17, -9, -6, -5, -2, 0, 2, 11, 21, 25, 55, 61, 66, 70, 90, 100, 111, 114, 117, 127, 137, 148]? Use linear search to check.","[-91, -88, -82, -81, -68, -63, -61, -43, -38, -36, -31, -29, -23, -20, -17, -9, -6, -5, -2, 0, 2, 11, 21, 25, 55, 61, 66, 70, 90, 100, 111, 114, 117, 127, 137, 148], 34",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 87 in the array [-99, -79, -54, -51, -24, -18, -9, -8, 8, 17, 19, 38, 40, 55, 58, 82, 84, 89, 91, 121, 127, 134, 137].","[-99, -79, -54, -51, -24, -18, -9, -8, 8, 17, 19, 38, 40, 55, 58, 82, 84, 89, 91, 121, 127, 134, 137], 87",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 85 in the array [-80, -75, -74, -70, -61, -46, -38, -29, -5, 2, 8, 10, 16, 27, 29, 33, 37, 42, 55, 69, 74, 80, 95, 111, 113, 137, 145].","[-80, -75, -74, -70, -61, -46, -38, -29, -5, 2, 8, 10, 16, 27, 29, 33, 37, 42, 55, 69, 74, 80, 95, 111, 113, 137, 145], 85",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 44 appear in [-94, -82, -56, -38, -13, -7, 13, 27, 33, 36, 41, 46, 59, 68, 81, 83, 85, 100, 105, 111, 117, 133, 134, 135, 143, 145]? Use linear search to check.","[-94, -82, -56, -38, -13, -7, 13, 27, 33, 36, 41, 46, 59, 68, 81, 83, 85, 100, 105, 111, 117, 133, 134, 135, 143, 145], 44",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 79 exists in [-95, -75, -22, -4, -3, -1, 30, 38, 46, 65, 111, 115, 116, 128].","[-95, -75, -22, -4, -3, -1, 30, 38, 46, 65, 111, 115, 116, 128], 79",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -48 in the following list: [-92, -86, -76, -67, -64, -63, -56, -51, -41, -40, -11, 8, 10, 21, 66, 80, 101, 107, 122, 130, 139, 140].","[-92, -86, -76, -67, -64, -63, -56, -51, -41, -40, -11, 8, 10, 21, 66, 80, 101, 107, 122, 130, 139, 140], -48",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 89 in the array [-100, -79, -55, -52, -17, -14, -7, 2, 3, 17, 23, 25, 27, 29, 38, 39, 54, 78, 88, 89, 103, 117, 131, 132, 139, 140, 143].","[-100, -79, -55, -52, -17, -14, -7, 2, 3, 17, 23, 25, 27, 29, 38, 39, 54, 78, 88, 89, 103, 117, 131, 132, 139, 140, 143], 89",Element found at index 19,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 5 in the array [-98, -92, -90, -81, -74, -72, -68, -66, -65, -62, -59, -51, -49, -43, -39, -21, -20, -19, -13, -11, 9, 10, 11, 16, 18, 20, 26, 29, 35, 42, 58, 62, 75, 77, 81, 88, 96, 99, 107, 110, 119, 125, 129, 140].","[-98, -92, -90, -81, -74, -72, -68, -66, -65, -62, -59, -51, -49, -43, -39, -21, -20, -19, -13, -11, 9, 10, 11, 16, 18, 20, 26, 29, 35, 42, 58, 62, 75, 77, 81, 88, 96, 99, 107, 110, 119, 125, 129, 140], 5",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 7 appear in [-89, -76, -70, -55, -51, -41, -35, -25, -21, -18, -8, 1, 10, 15, 34, 69, 93, 102, 123, 126, 141, 144, 145]? Use linear search to check.","[-89, -76, -70, -55, -51, -41, -35, -25, -21, -18, -8, 1, 10, 15, 34, 69, 93, 102, 123, 126, 141, 144, 145], 7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 37 exists in [-91, -88, -74, -64, -16, -15, -10, -5, -1, 11, 18, 49, 53, 72, 73, 77, 83, 88, 117, 142, 147].","[-91, -88, -74, -64, -16, -15, -10, -5, -1, 11, 18, 49, 53, 72, 73, 77, 83, 88, 117, 142, 147], 37",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 11 in the following list: [-97, -89, -85, -81, -79, -77, -74, -73, -72, -71, -65, -40, -39, -34, -20, -14, -11, -10, -4, 7, 12, 13, 19, 24, 45, 49, 53, 60, 63, 64, 74, 76, 80, 82, 83, 84, 88, 90, 106, 107, 109, 115, 120, 131, 137].","[-97, -89, -85, -81, -79, -77, -74, -73, -72, -71, -65, -40, -39, -34, -20, -14, -11, -10, -4, 7, 12, 13, 19, 24, 45, 49, 53, 60, 63, 64, 74, 76, 80, 82, 83, 84, 88, 90, 106, 107, 109, 115, 120, 131, 137], 11",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 68 in the array [-99, -94, -87, -69, -51, -50, -46, -44, -20, 14, 16, 19, 26, 37, 44, 56, 64, 68, 73, 117, 147].","[-99, -94, -87, -69, -51, -50, -46, -44, -20, 14, 16, 19, 26, 37, 44, 56, 64, 68, 73, 117, 147], 68",Element found at index 17,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 98 in the list [-97, -94, -87, -85, -83, -71, -65, -58, -49, -48, -33, -27, -23, -19, -17, -16, -11, -9, -7, -5, 12, 24, 32, 33, 36, 59, 67, 71, 76, 77, 78, 81, 86, 92, 103, 107, 108, 111, 116, 121, 133, 137, 138, 149].","[-97, -94, -87, -85, -83, -71, -65, -58, -49, -48, -33, -27, -23, -19, -17, -16, -11, -9, -7, -5, 12, 24, 32, 33, 36, 59, 67, 71, 76, 77, 78, 81, 86, 92, 103, 107, 108, 111, 116, 121, 133, 137, 138, 149], 98",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 48 in the following list: [-97, -88, -84, -71, -68, -67, -43, -42, -35, -32, -29, -20, -15, -8, -6, 3, 5, 7, 10, 12, 27, 29, 33, 35, 61, 69, 93, 119, 126, 129, 137, 140].","[-97, -88, -84, -71, -68, -67, -43, -42, -35, -32, -29, -20, -15, -8, -6, 3, 5, 7, 10, 12, 27, 29, 33, 35, 61, 69, 93, 119, 126, 129, 137, 140], 48",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 4 in the list [-85, -72, -71, -69, -66, -59, -58, -57, -46, -45, -44, -41, -39, -33, -27, -10, 4, 8, 9, 15, 17, 18, 21, 23, 25, 26, 34, 38, 39, 41, 62, 63, 71, 77, 80, 81, 91, 94, 95, 96, 99, 116, 139, 144, 147, 148, 149].","[-85, -72, -71, -69, -66, -59, -58, -57, -46, -45, -44, -41, -39, -33, -27, -10, 4, 8, 9, 15, 17, 18, 21, 23, 25, 26, 34, 38, 39, 41, 62, 63, 71, 77, 80, 81, 91, 94, 95, 96, 99, 116, 139, 144, 147, 148, 149], 4",Element found at index 16,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 82 in the array [-74, -61, -50, -44, -28, 22, 62].","[-74, -61, -50, -44, -28, 22, 62], 82",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -20 in the following list: [-41, -37, 2, 23, 32, 33, 57, 79, 81, 87, 89, 94, 102, 108, 119, 131].","[-41, -37, 2, 23, 32, 33, 57, 79, 81, 87, 89, 94, 102, 108, 119, 131], -20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -35 appear in [-68, -43, -26, 38, 40, 48, 82, 93, 102, 105]? Use linear search to check.","[-68, -43, -26, 38, 40, 48, 82, 93, 102, 105], -35",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -31 in the list [-93, -91, -90, -52, -45, -41, -37, -36, -35, -21, -4, 14, 43, 45, 49, 51, 61, 81, 95, 97, 98, 110, 114, 116, 124, 142, 144].","[-93, -91, -90, -52, -45, -41, -37, -36, -35, -21, -4, 14, 43, 45, 49, 51, 61, 81, 95, 97, 98, 110, 114, 116, 124, 142, 144], -31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -5 in the following list: [-99, -88, -81, -79, -75, -72, -63, -60, -48, -40, -28, -21, -20, -11, -8, -7, 8, 9, 12, 19, 24, 26, 32, 41, 42, 49, 56, 60, 63, 64, 65, 76, 83, 108, 110, 117, 121, 132, 137, 146, 149].","[-99, -88, -81, -79, -75, -72, -63, -60, -48, -40, -28, -21, -20, -11, -8, -7, 8, 9, 12, 19, 24, 26, 32, 41, 42, 49, 56, 60, 63, 64, 65, 76, 83, 108, 110, 117, 121, 132, 137, 146, 149], -5",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 42 in the following list: [-90, -79, -65, -62, -60, -48, -9, 17, 45, 46, 60, 63, 74, 77, 78, 80, 85, 98, 114, 127, 130].","[-90, -79, -65, -62, -60, -48, -9, 17, 45, 46, 60, 63, 74, 77, 78, 80, 85, 98, 114, 127, 130], 42",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 22 in the list [-93, -84, -83, -82, -77, -74, -65, -61, -48, -47, -44, -34, -26, -25, -11, -2, 1, 7, 11, 12, 17, 22, 26, 27, 30, 36, 37, 39, 44, 45, 47, 81, 87, 88, 94, 100, 101, 102, 115, 122, 123, 124, 135, 142, 149].","[-93, -84, -83, -82, -77, -74, -65, -61, -48, -47, -44, -34, -26, -25, -11, -2, 1, 7, 11, 12, 17, 22, 26, 27, 30, 36, 37, 39, 44, 45, 47, 81, 87, 88, 94, 100, 101, 102, 115, 122, 123, 124, 135, 142, 149], 22",Element found at index 21,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 64 appear in [-99, -98, -93, -84, -83, -80, -75, -70, -67, -56, -55, -54, -50, -48, -43, -42, -41, -35, -22, -3, 1, 10, 15, 17, 27, 33, 35, 37, 39, 52, 57, 64, 74, 87, 91, 96, 97, 112, 127, 130, 134]? Use linear search to check.","[-99, -98, -93, -84, -83, -80, -75, -70, -67, -56, -55, -54, -50, -48, -43, -42, -41, -35, -22, -3, 1, 10, 15, 17, 27, 33, 35, 37, 39, 52, 57, 64, 74, 87, 91, 96, 97, 112, 127, 130, 134], 64",Element found at index 31,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -25 exists in [-95, -88, -87, -59, -38, 9, 10, 13, 14, 34, 79, 80, 86, 108, 114, 125, 126].","[-95, -88, -87, -59, -38, 9, 10, 13, 14, 34, 79, 80, 86, 108, 114, 125, 126], -25",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 18 in the array [-97, -91, -74, -56, -27, -25, -13, 4, 9, 11, 13, 30, 40, 45, 52, 53, 57, 61, 66, 68, 78, 83, 86, 92, 113, 117, 127, 148].","[-97, -91, -74, -56, -27, -25, -13, 4, 9, 11, 13, 30, 40, 45, 52, 53, 57, 61, 66, 68, 78, 83, 86, 92, 113, 117, 127, 148], 18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -5 in the following list: [-96, -84, -74, -60, -57, -47, -45, -25, -17, -12, 16, 25, 27, 31, 43, 50, 55, 56, 68, 71, 86, 100, 106, 109, 113, 121, 123].","[-96, -84, -74, -60, -57, -47, -45, -25, -17, -12, 16, 25, 27, 31, 43, 50, 55, 56, 68, 71, 86, 100, 106, 109, 113, 121, 123], -5",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -25 appear in [-89, -88, 15, 18, 30, 66]? Use linear search to check.","[-89, -88, 15, 18, 30, 66], -25",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 65 in the array [-82, -78, -76, -19, -16, 5, 19, 32, 34, 36, 80, 84, 85, 90, 102, 113, 121, 133, 138].","[-82, -78, -76, -19, -16, 5, 19, 32, 34, 36, 80, 84, 85, 90, 102, 113, 121, 133, 138], 65",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -14 in the following list: [-100, -99, -82, -77, -76, -67, -64, -58, -42, -30, -21, -14, -12, -10, -5, 9, 10, 11, 27, 29, 38, 39, 66, 67, 96, 101, 110, 121, 122, 136, 143].","[-100, -99, -82, -77, -76, -67, -64, -58, -42, -30, -21, -14, -12, -10, -5, 9, 10, 11, 27, 29, 38, 39, 66, 67, 96, 101, 110, 121, 122, 136, 143], -14",Element found at index 11,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -22 appear in [-98, -90, -85, -82, -75, -71, -67, -58, -22, -12, 2, 21, 29, 32, 66, 68, 69, 101, 115, 118, 134]? Use linear search to check.","[-98, -90, -85, -82, -75, -71, -67, -58, -22, -12, 2, 21, 29, 32, 66, 68, 69, 101, 115, 118, 134], -22",Element found at index 8,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 66 in the list [-88, -86, -78, -69, -65, -58, -57, -55, -46, -43, -32, -29, -27, -25, -12, -11, -10, -6, -4, -3, 11, 19, 20, 32, 41, 45, 48, 53, 59, 66, 73, 76, 77, 82, 94, 125, 137, 140, 142, 149].","[-88, -86, -78, -69, -65, -58, -57, -55, -46, -43, -32, -29, -27, -25, -12, -11, -10, -6, -4, -3, 11, 19, 20, 32, 41, 45, 48, 53, 59, 66, 73, 76, 77, 82, 94, 125, 137, 140, 142, 149], 66",Element found at index 29,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -45 in the array [-96, -90, -88, -85, -51, -50, -42, -34, -33, -17, -11, -7, 0, 3, 10, 13, 14, 16, 20, 27, 33, 39, 41, 54, 65, 72, 78, 80, 83, 87, 99, 105, 119, 123, 134, 136, 144, 145, 147, 148].","[-96, -90, -88, -85, -51, -50, -42, -34, -33, -17, -11, -7, 0, 3, 10, 13, 14, 16, 20, 27, 33, 39, 41, 54, 65, 72, 78, 80, 83, 87, 99, 105, 119, 123, 134, 136, 144, 145, 147, 148], -45",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -6 in the following list: [-98, -95, -82, -78, -61, -56, -43, -42, -27, -25, -20, -18, -15, -12, -2, -1, 3, 4, 5, 8, 9, 10, 22, 23, 35, 36, 44, 45, 49, 54, 55, 64, 71, 74, 81, 86, 90, 101, 105, 106, 112, 117, 124, 132, 140, 142, 146, 147].","[-98, -95, -82, -78, -61, -56, -43, -42, -27, -25, -20, -18, -15, -12, -2, -1, 3, 4, 5, 8, 9, 10, 22, 23, 35, 36, 44, 45, 49, 54, 55, 64, 71, 74, 81, 86, 90, 101, 105, 106, 112, 117, 124, 132, 140, 142, 146, 147], -6",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 59 in the list [-95, -90, -82, -78, -77, -67, -65, -56, -39, -32, -30, 2, 5, 31, 39, 42, 45, 49, 54, 60, 104, 106, 145].","[-95, -90, -82, -78, -77, -67, -65, -56, -39, -32, -30, 2, 5, 31, 39, 42, 45, 49, 54, 60, 104, 106, 145], 59",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -44 appear in [-75, -57, 58, 75, 119, 129]? Use linear search to check.","[-75, -57, 58, 75, 119, 129], -44",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -9 in the following list: [-87, -86, -75, -25, -24, -20, -8, 5, 51, 63, 80, 88, 114, 116, 137, 140].","[-87, -86, -75, -25, -24, -20, -8, 5, 51, 63, 80, 88, 114, 116, 137, 140], -9",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 28 in the list [-97, -92, -90, -89, -80, -65, -62, -60, -49, -41, -32, -30, 1, 2, 4, 8, 23, 29, 37, 110, 116, 120, 131, 138].","[-97, -92, -90, -89, -80, -65, -62, -60, -49, -41, -32, -30, 1, 2, 4, 8, 23, 29, 37, 110, 116, 120, 131, 138], 28",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -10 exists in [-32, 31, 34, 87, 147].","[-32, 31, 34, 87, 147], -10",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 72 in the list [-100, -96, -94, -63, -53, -26, -24, -22, -3, 9, 15, 22, 24, 53, 79, 88, 94, 96, 105, 120, 122, 134].","[-100, -96, -94, -63, -53, -26, -24, -22, -3, 9, 15, 22, 24, 53, 79, 88, 94, 96, 105, 120, 122, 134], 72",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -29 in the following list: [-71, -64, -19, -9, 0, 31, 70, 119, 128, 129, 136, 144].","[-71, -64, -19, -9, 0, 31, 70, 119, 128, 129, 136, 144], -29",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -12 appear in [-100, -37, 5, 20, 25, 64, 67, 104, 118, 124, 134, 142, 149]? Use linear search to check.","[-100, -37, 5, 20, 25, 64, 67, 104, 118, 124, 134, 142, 149], -12",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 18 in the list [-92, -87, -82, -78, -71, -57, -50, -47, -36, -30, -27, -21, -19, -12, 1, 8, 13, 15, 25, 48, 49, 67, 74, 75, 80, 94, 96, 98, 101, 102, 117, 118, 123, 125, 127, 128, 143, 146].","[-92, -87, -82, -78, -71, -57, -50, -47, -36, -30, -27, -21, -19, -12, 1, 8, 13, 15, 25, 48, 49, 67, 74, 75, 80, 94, 96, 98, 101, 102, 117, 118, 123, 125, 127, 128, 143, 146], 18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -28 in the following list: [-70, -62, -21, 32, 35, 49, 52, 55, 84, 85, 122, 127, 149].","[-70, -62, -21, 32, 35, 49, 52, 55, 84, 85, 122, 127, 149], -28",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -41 in the array [-99, -88, -78, -49, -33, -12, 23, 31, 39, 44, 46, 56, 58, 80, 86, 95, 107].","[-99, -88, -78, -49, -33, -12, 23, 31, 39, 44, 46, 56, 58, 80, 86, 95, 107], -41",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 18 exists in [-97, -82, -76, -51, -41, 12, 25, 33, 36, 44, 49, 51, 105, 121, 129].","[-97, -82, -76, -51, -41, 12, 25, 33, 36, 44, 49, 51, 105, 121, 129], 18",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -5 in the following list: [-71, -44, -42, -13, -1, 5, 15, 41, 42, 47, 50, 74, 79, 82, 103, 120, 128, 130].","[-71, -44, -42, -13, -1, 5, 15, 41, 42, 47, 50, 74, 79, 82, 103, 120, 128, 130], -5",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -40 appear in [-97, -96, -90, -87, -68, -64, -60, -51, -44, -23, -7, -6, 4, 9, 68, 74, 84, 85, 88, 89, 93, 102, 147]? Use linear search to check.","[-97, -96, -90, -87, -68, -64, -60, -51, -44, -23, -7, -6, 4, 9, 68, 74, 84, 85, 88, 89, 93, 102, 147], -40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -14 in the array [-58, -56, -39, -16, -7, -6, 21, 67, 70, 89, 104, 106, 115, 133].","[-58, -56, -39, -16, -7, -6, 21, 67, 70, 89, 104, 106, 115, 133], -14",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -40 exists in [-98, -96, -87, -84, -82, -80, -68, -62, -58, -49, -47, -42, -39, -32, -28, -20, -16, -15, -14, -11, -3, 9, 22, 28, 31, 37, 40, 46, 55, 57, 62, 64, 66, 75, 87, 97, 106, 120, 121, 123, 124, 127, 135, 137, 142, 143, 144, 145].","[-98, -96, -87, -84, -82, -80, -68, -62, -58, -49, -47, -42, -39, -32, -28, -20, -16, -15, -14, -11, -3, 9, 22, 28, 31, 37, 40, 46, 55, 57, 62, 64, 66, 75, 87, 97, 106, 120, 121, 123, 124, 127, 135, 137, 142, 143, 144, 145], -40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 93 in the following list: [-94, -91, -89, -88, -82, -62, -53, -45, -34, -17, -16, -6, -2, 6, 17, 22, 33, 39, 43, 50, 62, 78, 88, 94, 108, 118, 134, 141].","[-94, -91, -89, -88, -82, -62, -53, -45, -34, -17, -16, -6, -2, 6, 17, 22, 33, 39, 43, 50, 62, 78, 88, 94, 108, 118, 134, 141], 93",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -41 exists in [-100, -99, -97, -90, -85, -82, -80, -78, -73, -55, -33, -32, -27, -25, -21, -16, -15, -3, -1, 8, 12, 22, 23, 25, 37, 38, 52, 58, 59, 61, 71, 89, 94, 97, 98, 100, 103, 110, 125, 129, 139, 140, 147].","[-100, -99, -97, -90, -85, -82, -80, -78, -73, -55, -33, -32, -27, -25, -21, -16, -15, -3, -1, 8, 12, 22, 23, 25, 37, 38, 52, 58, 59, 61, 71, 89, 94, 97, 98, 100, 103, 110, 125, 129, 139, 140, 147], -41",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 29 exists in [-95, -91, -86, -79, -72, -54, -51, -39, -35, -34, -29, -24, -18, -17, -5, -3, 18, 22, 24, 31, 32, 33, 39, 45, 50, 53, 55, 63, 65, 68, 71, 89, 91, 99, 104, 105, 116, 121, 124, 126, 136, 140, 146].","[-95, -91, -86, -79, -72, -54, -51, -39, -35, -34, -29, -24, -18, -17, -5, -3, 18, 22, 24, 31, 32, 33, 39, 45, 50, 53, 55, 63, 65, 68, 71, 89, 91, 99, 104, 105, 116, 121, 124, 126, 136, 140, 146], 29",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 76 in the array [-99, -98, -97, -84, -82, -81, -67, -63, -54, -52, -51, -49, -47, -43, -38, -30, -27, -24, -22, -13, -11, -7, 8, 12, 13, 15, 16, 28, 38, 39, 40, 55, 65, 69, 79, 82, 84, 86, 93, 106, 111, 125, 126, 127, 129, 134, 137, 140, 146].","[-99, -98, -97, -84, -82, -81, -67, -63, -54, -52, -51, -49, -47, -43, -38, -30, -27, -24, -22, -13, -11, -7, 8, 12, 13, 15, 16, 28, 38, 39, 40, 55, 65, 69, 79, 82, 84, 86, 93, 106, 111, 125, 126, 127, 129, 134, 137, 140, 146], 76",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -17 in the array [-21, -19, -1, 30, 47, 57, 64, 74, 82, 128].","[-21, -19, -1, 30, 47, 57, 64, 74, 82, 128], -17",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -17 appear in [-97, -95, -94, -93, -86, -82, -78, -75, -66, -63, -58, -55, -52, -50, -39, -25, -22, -18, -17, -10, -9, 3, 5, 6, 17, 18, 26, 30, 34, 42, 43, 49, 54, 58, 61, 64, 74, 77, 79, 92, 95, 109, 119, 131, 132, 134, 141, 147, 149]? Use linear search to check.","[-97, -95, -94, -93, -86, -82, -78, -75, -66, -63, -58, -55, -52, -50, -39, -25, -22, -18, -17, -10, -9, 3, 5, 6, 17, 18, 26, 30, 34, 42, 43, 49, 54, 58, 61, 64, 74, 77, 79, 92, 95, 109, 119, 131, 132, 134, 141, 147, 149], -17",Element found at index 18,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -5 in the array [-98, -82, -79, -78, -74, -73, -67, -56, -54, -50, -46, -45, -39, -36, -21, -17, -10, -5, -2, 4, 9, 15, 20, 27, 29, 38, 40, 41, 46, 52, 60, 61, 66, 71, 75, 78, 80, 86, 96, 111, 121, 127, 137, 147, 148].","[-98, -82, -79, -78, -74, -73, -67, -56, -54, -50, -46, -45, -39, -36, -21, -17, -10, -5, -2, 4, 9, 15, 20, 27, 29, 38, 40, 41, 46, 52, 60, 61, 66, 71, 75, 78, 80, 86, 96, 111, 121, 127, 137, 147, 148], -5",Element found at index 17,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 8 in the array [-98, -78, -50, -49, -35, -34, -24, -12, -9, 7, 10, 12, 15, 29, 33, 51, 52, 71, 78, 86, 87, 88, 101, 107, 124, 147, 149].","[-98, -78, -50, -49, -35, -34, -24, -12, -9, 7, 10, 12, 15, 29, 33, 51, 52, 71, 78, 86, 87, 88, 101, 107, 124, 147, 149], 8",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if -3 exists in [-99, -84, -83, -68, -64, -58, -57, -53, -50, -48, -44, -43, -36, -34, -33, -30, -27, -24, -22, -19, -18, -16, -11, -6, -2, 1, 2, 9, 10, 14, 37, 44, 45, 48, 52, 54, 61, 65, 70, 73, 85, 88, 91, 97, 102, 105, 107, 126, 146, 149].","[-99, -84, -83, -68, -64, -58, -57, -53, -50, -48, -44, -43, -36, -34, -33, -30, -27, -24, -22, -19, -18, -16, -11, -6, -2, 1, 2, 9, 10, 14, 37, 44, 45, 48, 52, 54, 61, 65, 70, 73, 85, 88, 91, 97, 102, 105, 107, 126, 146, 149], -3",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate -37 in the following list: [-89, -85, -63, -57, -53, -32, -27, -16, -9, -7, 33, 49, 52, 60, 62, 64, 73, 78, 85, 94, 125].","[-89, -85, -63, -57, -53, -32, -27, -16, -9, -7, 33, 49, 52, 60, 62, 64, 73, 78, 85, 94, 125], -37",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 41 in the array [-98, -90, -58, -48, -24, -20, -15, -5, -2, 34, 64, 68, 81, 107, 115, 119, 136, 141, 146, 147, 148].","[-98, -90, -58, -48, -24, -20, -15, -5, -2, 34, 64, 68, 81, 107, 115, 119, 136, 141, 146, 147, 148], 41",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of -7 in the array [-86, -79, -72, -59, -56, -54, -34, -20, 11, 18, 22, 23, 33, 38, 39, 52, 58, 63, 96, 98, 102, 118, 139, 144].","[-86, -79, -72, -59, -56, -54, -34, -20, 11, 18, 22, 23, 33, 38, 39, 52, 58, 63, 96, 98, 102, 118, 139, 144], -7",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 97 appear in [-89, -54, 37, 83, 92, 100, 140, 141]? Use linear search to check.","[-89, -54, 37, 83, 92, 100, 140, 141], 97",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 23 appear in [-94, -71, -64, -62, -53, -41, -29, -13, -10, -7, -2, 10, 24, 31, 40, 45, 50, 55, 59, 61, 62, 66, 74, 76, 79, 93, 96, 98, 101, 106, 110, 116, 122, 129, 135, 137, 141, 146]? Use linear search to check.","[-94, -71, -64, -62, -53, -41, -29, -13, -10, -7, -2, 10, 24, 31, 40, 45, 50, 55, 59, 61, 62, 66, 74, 76, 79, 93, 96, 98, 101, 106, 110, 116, 122, 129, 135, 137, 141, 146], 23",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 69 in the array [-99, -96, -88, -82, -76, -75, -74, -73, -59, -50, -44, -34, -33, -30, -29, -16, -6, -2, 2, 4, 5, 12, 14, 19, 29, 30, 37, 38, 43, 47, 60, 70, 76, 80, 82, 91, 94, 100, 114, 126, 132, 136, 137, 138, 144, 145].","[-99, -96, -88, -82, -76, -75, -74, -73, -59, -50, -44, -34, -33, -30, -29, -16, -6, -2, 2, 4, 5, 12, 14, 19, 29, 30, 37, 38, 43, 47, 60, 70, 76, 80, 82, 91, 94, 100, 114, 126, 132, 136, 137, 138, 144, 145], 69",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 75 in the array [-44, -36, -34, 76, 89, 127].","[-44, -36, -34, 76, 89, 127], 75",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 0 appear in [-99, -95, -93, -88, -85, -83, -79, -77, -63, -62, -60, -59, -53, -49, -39, -32, -22, -20, -13, -11, 6, 8, 15, 21, 22, 27, 28, 32, 33, 39, 48, 57, 61, 64, 65, 67, 70, 75, 78, 92, 100, 102, 106, 107, 110, 117, 132, 134, 135]? Use linear search to check.","[-99, -95, -93, -88, -85, -83, -79, -77, -63, -62, -60, -59, -53, -49, -39, -32, -22, -20, -13, -11, 6, 8, 15, 21, 22, 27, 28, 32, 33, 39, 48, 57, 61, 64, 65, 67, 70, 75, 78, 92, 100, 102, 106, 107, 110, 117, 132, 134, 135], 0",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 22 exists in [-94, -92, -89, -86, -84, -80, -62, -61, -60, -55, -48, -45, -27, -19, -12, 1, 2, 9, 13, 39, 40, 43, 48, 52, 59, 61, 63, 76, 88, 93, 95, 120, 123, 126, 135, 136, 138].","[-94, -92, -89, -86, -84, -80, -62, -61, -60, -55, -48, -45, -27, -19, -12, 1, 2, 9, 13, 39, 40, 43, 48, 52, 59, 61, 63, 76, 88, 93, 95, 120, 123, 126, 135, 136, 138], 22",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 3 in the array [-70, -59, -37, -36, -31, -25, -17, 0, 55, 92, 128, 134, 139].","[-70, -59, -37, -36, -31, -25, -17, 0, 55, 92, 128, 134, 139], 3",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 53 in the list [-91, -90, -84, -77, -71, -34, -26, -23, -4, 3, 17, 23, 49, 58, 78, 86, 96, 106, 131].","[-91, -90, -84, -77, -71, -34, -26, -23, -4, 3, 17, 23, 49, 58, 78, 86, 96, 106, 131], 53",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 41 in the list [-96, -89, -84, -68, -51, -45, -5, 1, 11, 15, 20, 39, 49, 73, 80, 89, 120, 144].","[-96, -89, -84, -68, -51, -45, -5, 1, 11, 15, 20, 39, 49, 73, 80, 89, 120, 144], 41",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 37 appear in [-97, -93, -88, -85, -81, -78, -64, -61, -54, -51, -49, -44, -37, -30, -26, -25, -22, -19, -16, -3, -2, 2, 8, 10, 11, 26, 27, 38, 45, 46, 55, 56, 60, 62, 76, 89, 92, 94, 108, 109, 112, 113, 115, 119, 120, 125, 129, 147, 148]? Use linear search to check.","[-97, -93, -88, -85, -81, -78, -64, -61, -54, -51, -49, -44, -37, -30, -26, -25, -22, -19, -16, -3, -2, 2, 8, 10, 11, 26, 27, 38, 45, 46, 55, 56, 60, 62, 76, 89, 92, 94, 108, 109, 112, 113, 115, 119, 120, 125, 129, 147, 148], 37",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 31 exists in [-83, -80, -78, -71, -49, -48, -39, -30, -28, -21, -20, -18, -17, -8, -7, -5, 1, 8, 12, 19, 34, 49, 60, 84, 86, 87, 96, 107, 108, 118, 129, 137, 143, 148].","[-83, -80, -78, -71, -49, -48, -39, -30, -28, -21, -20, -18, -17, -8, -7, -5, 1, 8, 12, 19, 34, 49, 60, 84, 86, 87, 96, 107, 108, 118, 129, 137, 143, 148], 31",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 4 exists in [-88, -84, -79, 17, 19, 23, 33, 50, 81, 95, 101, 123, 128, 145].","[-88, -84, -79, 17, 19, 23, 33, 50, 81, 95, 101, 123, 128, 145], 4",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 12 in the list [-100, -92, -75, -68, -65, -44, -41, -7, 10, 19, 23, 32, 52, 57, 59, 72, 95, 99, 101, 124, 134].","[-100, -92, -75, -68, -65, -44, -41, -7, 10, 19, 23, 32, 52, 57, 59, 72, 95, 99, 101, 124, 134], 12",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 42 in the list [-82, -68, -47, -40, -38, -35, -26, -13, -1, 10, 28, 38, 45, 48, 49, 52, 57, 58, 60, 61, 66, 69, 75, 76, 107, 147].","[-82, -68, -47, -40, -38, -35, -26, -13, -1, 10, 28, 38, 45, 48, 49, 52, 57, 58, 60, 61, 66, 69, 75, 76, 107, 147], 42",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 28 appear in [-42, -20, -19, 0, 4, 39, 44, 76, 111, 123, 140]? Use linear search to check.","[-42, -20, -19, 0, 4, 39, 44, 76, 111, 123, 140], 28",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 78 in the following list: [-94, -91, -83, -73, -65, -62, -61, -59, -56, -54, -42, -37, -29, -12, -10, -6, -4, -1, 6, 8, 9, 28, 33, 56, 57, 59, 63, 77, 87, 89, 96, 120, 121, 143, 146].","[-94, -91, -83, -73, -65, -62, -61, -59, -56, -54, -42, -37, -29, -12, -10, -6, -4, -1, 6, 8, 9, 28, 33, 56, 57, 59, 63, 77, 87, 89, 96, 120, 121, 143, 146], 78",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 78 in the following list: [-95, -85, -81, -80, -57, -31, -27, -23, -22, -19, -16, -11, -10, -7, 14, 19, 22, 25, 32, 34, 38, 42, 45, 49, 50, 52, 57, 58, 65, 68, 73, 77, 79, 84, 88, 99, 108, 119, 129, 133, 135, 140, 143].","[-95, -85, -81, -80, -57, -31, -27, -23, -22, -19, -16, -11, -10, -7, 14, 19, 22, 25, 32, 34, 38, 42, 45, 49, 50, 52, 57, 58, 65, 68, 73, 77, 79, 84, 88, 99, 108, 119, 129, 133, 135, 140, 143], 78",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element -20 in the list [-90, -84, -35, -27, 26, 47, 78, 143, 147].","[-90, -84, -35, -27, 26, 47, 78, 143, 147], -20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 43 in the list [-91, -81, -51, -45, -41, -21, -12, 27, 28, 70, 128].","[-91, -81, -51, -45, -41, -21, -12, 27, 28, 70, 128], 43",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 90 in the list [-100, -96, -87, -83, -81, -76, -71, -65, -58, -56, -55, -54, -42, -40, -39, -33, -21, -19, -16, -11, -6, 9, 14, 16, 17, 22, 36, 41, 45, 47, 48, 53, 56, 58, 59, 65, 66, 73, 92, 94, 99, 105, 107, 111, 112, 115, 117, 138].","[-100, -96, -87, -83, -81, -76, -71, -65, -58, -56, -55, -54, -42, -40, -39, -33, -21, -19, -16, -11, -6, 9, 14, 16, 17, 22, 36, 41, 45, 47, 48, 53, 56, 58, 59, 65, 66, 73, 92, 94, 99, 105, 107, 111, 112, 115, 117, 138], 90",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does 23 appear in [-97, -95, -94, -89, -88, -84, -78, -77, -74, -73, -70, -67, -55, -54, -39, -37, -31, -25, -22, -20, -7, -2, 0, 1, 10, 16, 23, 25, 38, 44, 49, 53, 56, 75, 83, 85, 88, 96, 98, 106, 110, 116, 118, 125, 127, 128, 130, 142, 143, 144]? Use linear search to check.","[-97, -95, -94, -89, -88, -84, -78, -77, -74, -73, -70, -67, -55, -54, -39, -37, -31, -25, -22, -20, -7, -2, 0, 1, 10, 16, 23, 25, 38, 44, 49, 53, 56, 75, 83, 85, 88, 96, 98, 106, 110, 116, 118, 125, 127, 128, 130, 142, 143, 144], 23",Element found at index 26,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Locate 19 in the following list: [-95, -87, -83, -57, -54, -40, -26, -23, -21, -15, -13, -9, 0, 2, 6, 14, 34, 55, 56, 62, 70, 81, 91, 92, 105, 111, 119, 143].","[-95, -87, -83, -57, -54, -40, -26, -23, -21, -15, -13, -9, 0, 2, 6, 14, 34, 55, 56, 62, 70, 81, 91, 92, 105, 111, 119, 143], 19",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Find the position of 24 in the array [-100, -82, -78, -65, -47, -6, 4, 6, 30, 59, 63, 119, 131, 139, 140].","[-100, -82, -78, -65, -47, -6, 4, 6, 30, 59, 63, 119, 131, 139, 140], 24",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Search for the element 43 in the list [-89, -81, -72, -69, -45, -36, -21, -19, 6, 10, 17, 33, 42, 53, 63, 69, 73, 92, 95, 127, 130, 133, 136, 143, 148].","[-89, -81, -72, -69, -45, -36, -21, -19, 6, 10, 17, 33, 42, 53, 63, 69, 73, 92, 95, 127, 130, 133, 136, 143, 148], 43",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 40 exists in [-80, -71, -66, -62, -56, -52, -50, -42, -40, -39, -35, 12, 15, 17, 31, 47, 56, 58, 61, 75, 89, 98, 105, 108, 123, 128].","[-80, -71, -66, -62, -56, -52, -50, -42, -40, -39, -35, 12, 15, 17, 31, 47, 56, 58, 61, 75, 89, 98, 105, 108, 123, 128], 40",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Does -20 appear in [-86, -73, -70, -64, -61, -60, -51, -44, -39, -31, -29, -26, -25, -24, -17, -16, -13, -11, -9, -4, 2, 9, 10, 14, 24, 25, 36, 61, 68, 78, 86, 100, 103, 104, 108, 124, 126, 138]? Use linear search to check.","[-86, -73, -70, -64, -61, -60, -51, -44, -39, -31, -29, -26, -25, -24, -17, -16, -13, -11, -9, -4, 2, 9, 10, 14, 24, 25, 36, 61, 68, 78, 86, 100, 103, 104, 108, 124, 126, 138], -20",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard Linear Search,Searching,O(n),O(1),Array,Brute Force,"List of n elements, target value to search",O(n),O(n),O(1),Iterative,"Searching in unsorted lists, small datasets","Using linear search, determine if 11 exists in [-73, -65, -63, -43, -34, -29, -19, 1, 7, 26, 31, 40, 57, 78, 79, 85, 93, 94, 103, 112, 128, 135, 139, 149].","[-73, -65, -63, -43, -34, -29, -19, 1, 7, 26, 31, 40, 57, 78, 79, 85, 93, 94, 103, 112, 128, 135, 139, 149], 11",Element not found,"The algorithm traverses the list from the first to last element, checking each one against the target value.","def linear_search(arr, target): for i in range(len(arr)): if arr[i] == target: return i return -1",Hard