Editing Technology/Software Development/General knowledge/Programming Fundamentals/Algorithms (section)

== Common Algorithmic Concepts ==
As you dive deeper into the world of algorithms, you will come across some common concepts. Here are a few fundamental ones:

'''Sorting Algorithms:''' Sorting algorithms arrange a collection of elements in a specific order, such as numerical or alphabetical. An example of a sorting algorithm is the Bubble Sort:

<pre>
function bubbleSort(arr):
    n = length(arr)
    for i from 0 to n-1:
        for j from 0 to n-i-1:
            if arr[j] > arr[j+1]:
                swap(arr[j], arr[j+1])
    return arr
</pre>

'''Search Algorithms:''' Search algorithms find a specific element within a collection. An example of a search algorithm is the Binary Search, commonly used for sorted arrays:

<pre>
function binarySearch(arr, target):
    low = 0
    high = length(arr) - 1
    while low <= high:
        mid = (low + high) // 2
        if arr[mid] == target:
            return mid
        elif arr[mid] < target:
            low = mid + 1
        else:
            high = mid - 1
    return -1
</pre>

'''Recursion:''' Recursion is a technique where a function calls itself to solve a smaller instance of the same problem. Here's an example of a recursive function to calculate the factorial of a number:
function factorial(n):
    if n == 0:
        return 1
    else:
        return n * factorial(n-1)


'''Conclusion'''

Algorithms are powerful tools that enable computers to solve problems and perform tasks efficiently. By understanding the fundamental concepts of algorithms, you can develop computational thinking and enhance your problem-solving skills.