Algorithms on Data Structures

When it comes to working with data structures, it's not just about organizing and storing the data efficiently. We also need to perform various operations on the data, such as searching, sorting, and manipulating. This is where algorithms on data structures come into play.

An algorithm is a step-by-step procedure or a set of rules to solve a specific problem. In the context of data structures, algorithms are designed to perform specific tasks on the data stored within the structures.

For example, let's consider an algorithm to search for an element in an array. One popular algorithm for this task is the binary search. It takes advantage of the fact that the array is sorted and repeatedly divides the search space in half until the target element is found or determined to be not present.

Here's a Python example of the binary search algorithm for searching an element in a sorted array:

1def binary_search(arr, target):
2    left = 0
3    right = len(arr) - 1
4
5    while left <= right:
6        mid = (left + right) // 2
7
8        if arr[mid] == target:
9            return mid
10        elif arr[mid] < target:
11            left = mid + 1
12        else:
13            right = mid - 1
14
15    return -1
16
17# Example usage
18arr = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
19target = 7
20index = binary_search(arr, target)
21
22if index != -1:
23    print(f"{target} found at index {index}")
24else:
25    print(f"{target} not found")

xxxxxxxxxx

if __name__ == "__main__":

  for i in range(1, 101):

    if i % 3 == 0 and i % 5 == 0:

        print("FizzBuzz")

    elif i % 3 == 0:

        print("Fizz")

    elif i % 5 == 0:

        print("Buzz")

    else:

        print(i)

​

  print("Print something")