Scribd
Upload
3 views

Algorithms

Uploaded by

bikinosisharmaine308
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Algorithms

Uploaded by

bikinosisharmaine308
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Understanding Algorithms

Algorithms are fundamental to computer science and programming. They provide a systematic way to
solve problems and perform tasks.

1. What is an Algorithm?

An algorithm is a step-by-step procedure for solving a problem or performing a task. It consists of a finite
number of well-defined instructions that can be followed to achieve a specific outcome.

Key Characteristics of Algorithms:

- Finiteness: Must terminate after a finite number of steps.

- Definiteness: Each step must be precisely defined.

- Input: Can accept zero or more inputs.

- Output: Produces one or more outputs.

- Effectiveness: Each step must be basic enough to be performed in a finite amount of time.

2. Practical Examples of Algorithms

Example 1: Sorting Algorithm (Bubble Sort)

Purpose: To arrange a list of numbers in ascending order.

Python Code:

Def bubble_sort(arr):

N = len(arr)

For I in range(n):

For j in range(0, n-i-1):

If arr[j] > arr[j+1]:


Arr[j], arr[j+1] = arr[j+1], arr[j] # Swap

Return arr

# Example usage

Numbers = [64, 34, 25, 12, 22, 11, 90]

Sorted_numbers = bubble_sort(numbers)

Print(“Sorted array:”, sorted_numbers)

Example 2: Searching Algorithm (Linear Search)

Purpose: To find a specific value in a list.

Python Code:

Def linear_search(arr, target):

For I in range(len(arr)):

If arr[i] == target:

Return I # Return the index

Return -1 # Not found

# Example usage

Numbers = [10, 20, 30, 40, 50]

Index = linear_search(numbers, 30)

Print(“Element found at index:”, index)

Example 3: Finding the Maximum Number

Purpose: To find the largest number in a list.


Python Code:

Def find_max(arr):

Max_num = arr[0]

For I in range(1, len(arr)):

If arr[i] > max_num:

Max_num = arr[i]

Return max_num

# Example usage

Numbers = [3, 5, 7, 2, 8]

Maximum = find_max(numbers)

Print(“Maximum number:”, maximum)

Example 4: Factorial Calculation

Purpose: To compute the factorial of a non-negative integer.

Python Code:

Def factorial(n):

If n == 0:

Return 1 # Base case

Else:

Return n * factorial(n – 1) # Recursive case

# Example usage

Num = 5
Result = factorial(num)

Print(“Factorial of”, num, “is:”, result)

Example 5: Fibonacci Sequence

Purpose: To generate the Fibonacci sequence up to a certain number.

Python Code:

Def fibonacci(n):

Fib = [0, 1]

For I in range(2, n):

Next_fib = fib[i-1] + fib[i-2]

Fib.append(next_fib)

Return fib[:n] # Return the first n Fibonacci numbers

# Example usage

Length = 10

Fib_sequence = fibonacci(length)

Print(“Fibonacci sequence:”, fib_sequence)

Understanding algorithms is crucial for developing problem-solving skills in programming. By exploring


practical examples in Python we can gain a deeper appreciation of how algorithms function and their
applications in real-world scenarios.

You might also like