What is an algorithm ?

• A programming language used to build computer applications.
• A type of computer hardware that processes data.
• A security protocol for protecting information online.
• A set of step-by-step instructions designed to solve a problem or perform a task.

What is the task of a scientist in the science computer field ?

• To write laws for computer usage in courts.
• To teach only elementary school science classes.
• To conduct research and develop new theories, techniques, or technologies in the field of computing.
• To repair household electronic appliances.

You will learn about two things in this algorithm ( 3 form ) Search and Sort

They are two types of Search , they are...

• Depth-first search and depth-second search.
• Linear search and binary search.
• Sorting and merging.
• Branching and looping.

What is Search ?

• finding information

What is Linear Search ?

• Linear Search sorts an array by repeatedly swapping the smallest elements to the front.
• Linear Search creates a tree structure to organize and search data efficiently.
• Linear Search is a method for finding a specific value in a list by checking each element one by one from the beginning to the end.
• Linear Search divides the list into halves to repeatedly search, reducing the search area each time.

Linear Search is a very efficient proses to use for searching a specific item

Linear Search is a very easy proses

What is a Binary Search ?

• Dividing a sorted list to locate an item

• Halving search in an ordered array

• Half search

Binary Search is a efficient search proses

Explain the Proses of Binary Search

• Binary search scans each element in the list from the beginning to the end and stops when it finds the target value.
• Binary search works by repeatedly dividing a sorted list in half, comparing the target value to the middle element, and narrowing the search interval to the half where the target could be until it is found or the interval is empty.
• Binary search starts at the end of the list and checks each element backwards to locate the target value.
• Binary search can only be used on lists that are unsorted because it does not rely on order.

What is Sort ?

• It means grouping objects based on their color or size.
• It is the process of arranging items in a specific order, such as ascending or descending.
• It refers to calculating the total value of a set of numbers.
• It is the act of removing items from a list or collection.

They are two types of Sort , they are....

• Internal sort and external sort.
• Bubble sort and Bucket sort.
• Ascending sort and descending sort.
• Simple sort and complex sort.

Explain the proses of Bubble Sort

• Comparisons

• Compares

• Comparison

• Exchange

What do we use Bubble Sort in ?

• Encrypting information for secure communication.
• Searching for a specific file within a computer system.
• Sorting a sequence of data values, such as numbers or names.
• Compressing large files to save storage space.

What is Bucket Sort ?

• Bucket Sort refers to an encryption method for securing large lists.
• Bucket Sort organizes data into binary trees before sorting them.
• Bucket Sort is a searching algorithm used to find elements in an unsorted list quickly.
• Bucket Sort is a sorting algorithm that divides the input elements into different groups called 'buckets,' sorts each bucket individually, and then combines the sorted buckets to get the final sorted list.

What is the difference between Bubble Sort and Bucket Sort

• Both sorting algorithms are unstable and have the same time complexity in all cases.
• Bubble Sort repeatedly steps through the list, comparing and swapping adjacent items, while Bucket Sort distributes elements into several buckets and sorts each bucket individually.
• Bucket Sort is designed for linked lists, and Bubble Sort is for sorting objects in random order without comparison.
• Bubble Sort is suitable for sorting data stored only in buckets, while Bucket Sort is only used for reversing a list.

What both Bubble Sort and Bucket Sort share in common ?

• They always have a worst-case time complexity better than O(n log n).
• They are both comparison-based sorting algorithms in the typical implementation.
• Both require the input data to be already sorted for optimal performance.
• Both are stable sorts only when implemented recursively.

Give one activity to use Bucket Sort

• Compressing a large file to save storage space.
• Sorting students' heights that are distributed uniformly within a known range.
• Encrypting a secret message using a cipher algorithm.
• Finding the shortest path between two cities on a map.

Is both process hard ?