preamble
Linear lookup algorithm is a simple lookup algorithm used to find a specific element in an array or list. It starts from the first element of the array and checks each element one by one until it finds the desired element or searches the entire array. The time complexity of linear lookup is O(n), where n is the number of elements in the array.
Implementation Principle
- Starting from the first element of the list, check each element one by one.
- Returns the index of the current element if it is equal to the target element.
- If no match is found by traversing the entire array, a value indicating that it was not found is returned (usually -1).
code implementation
public static void LinearSearchRun()
{
int[] arr = { 2, 3, 4, 10, 40, 50, 100, 77, 88, 99 };
int target = 100;
int result = LinearSearch(arr, target);
// Output results
if (result == -1)
{
("Element not found").
}
else
{
($"Element found at index {result}, index = {result}");
}
}
/// <summary>
/// Linear lookup function
/// </summary>
/// <param name="arr">arr</param>
/// <param name="target">target</param>
/// <returns></returns>
public static int LinearSearch(int[] arr, int target)
{
// Traverse the array
for (int i = 0; i < ; i++)
{
// If the target value is found, return its index
if (arr[i] == target)
{
return i;
}
}
// Return -1 if not found
return -1;
}
final conclusion
The linear lookup algorithm is simple and easy to understand and is suitable for small or unordered datasets. Its main advantage is that it is simple to implement and does not require sorting of data. However, due to its time complexity of O(n), it is less efficient for large-scale datasets. For large-scale datasets or scenarios that require frequent lookups, consider using more efficient lookup algorithms such as binary lookup (for ordered datasets) or hash lookup.
A Practical Beginner's Guide to C# Algorithms
/s/XPRmwWmoZa4zq29Kx-u4HA