DeveloperBreeze

Binary Search in Python

python
#Algorithm #Binary Search 
# Function to perform binary search on a sorted array
def binary_search(arr, target):
    low, high = 0, len(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

# Usage: Perform binary search on a sorted array
arr = [1, 2, 3, 4, 5, 6, 7, 8, 9]
target = 5
result = binary_search(arr, target)

Continue Reading

Handpicked posts just for you — based on your current read.

JavaScript DSA (Data Structures and Algorithms) Tutorial: A Beginner's Guide

Example:

let numbers = [10, 20, 30, 40, 50];

// Accessing elements
console.log(numbers[0]); // Output: 10

// Modifying elements
numbers[1] = 25;
console.log(numbers[1]); // Output: 25

// Adding elements
numbers.push(60);
console.log(numbers); // Output: [10, 25, 30, 40, 50, 60]

// Removing elements
numbers.pop();
console.log(numbers); // Output: [10, 25, 30, 40, 50]

Aug 30, 2024 Tutorial

Prime Number Check and Prime Number Generation in JavaScript

No preview available for this content.

Jan 26, 2024 Code

Generate Fibonacci Sequence

No preview available for this content.

Jan 26, 2024 Code

Swap Two Numbers Without Using a Temporary Variable

No preview available for this content.

Jan 26, 2024 Code

Calculate Factorial 

public static long factorial(int n) {
    if (n == 0 || n == 1) {
        return 1;
    }
    return n * factorial(n - 1);
}

int number = 5;
long result = factorial(number);
System.out.println("Factorial of " + number + " is " + result);

Jan 26, 2024 Code

Discussion 0

Please sign in to join the discussion.

No comments yet. Start the discussion!