@kenbitanga

<?php function swap(&$array, $i, $j) { $temp = $array[$i]; $array[$i] = $array[$j]; $array[$j] = $temp; } function indexOfMin(&$array, $startIndex) { $minValue = $array[$startIndex];

def swap(array, i, j) temp = array[i] array[i] = array[j] array[j] = temp end def index_of_min(array, start_index) min_value = array[start_index] min_index = start_index for i in (min_index + 1)...array.length

def swap(array, i, j): temp = array[i] array[i] = array[j] array[j] = temp def index_of_min(array, start_index): min_value = array[start_index] min_index = start_index i = min_index + 1 while i < len(array):

def sum_series(n): return (n+1) * (n/2) # or (n*n/2) + (n/2) print(sum_series(5)) # 1+2+3+4+5

function swap(array, i, j) { let temp = array[i]; array[i] = array[j]; array[j] = temp } function indexOfMinimum(array, startIndex) { let minValue = array[startIndex]; let minIndex = startIndex;

using System; namespace MyCompiler { class Program { private static int Bsearch(int[] array, int target) { int min = 0; int max = array.Length - 1; while (max >= min) { int mid = (min

class Main { private static int bsearch(final int[] array, final int target) { int min = 0; int max = array.length - 1; while (max >= min) { int mid = (min + max) / 2; if (target == array[mid]) {

#include <iostream> #include <vector> int bsearch(const std::vector<int>& array, const int target) { int min = 0; int max = array.size() - 1; while (max >= min) { int mid = (min + max) / 2; if (target == array[mid])

package main import ( "fmt" ) func bsearch(array []int, target int) int { min := 0; max := len(array) - 1; for max >= min {

<?php function bsearch(array $array, int $target): int { $min = 0; $max = count($array) - 1; while ($max >= $min) { $mid = floor(($min + $max) / 2); if ($target == $array[$mid]) { return $mid; }

def bsearch(array, target) min = 0 max = array.length - 1 while max >= min mid = (min + max).div(2) if target == array[mid] return mid end if target > array[mid] min = mid +

function bsearch(array, target) { let min = 0; let max = array.length - 1; while (max >= min) { let mid = Math.floor((min + max) / 2) if (target === array[mid]) { return mid; } if (target > arr

def bsearch(array, target): min = 0 max = len(array) - 1 while max >= min: mid = (min + max) // 2 if array[mid] == target: return mid if array[mid] < target: min = mid + 1 else:

data = {"country": ["Brazil", "Russia", "India", "China", "South Africa"], "capital": ["Brasilia", "Moscow", "New Dehli", "Beijing", "Pretoria"], "area": [8.516, 17.10, 3.286, 9.597, 1.221], "population": [200.4, 143.5, 1252,

const map = [ { name: 'jake', grade: 90 }, { name: 'cake', grade: 80 }, { name: 'make', grade: 70 }, { name: 'rake', grade: 90 }, { name: 'bake', grade: 80 }, { name: 'sake', grade: 70 }, ] const res = map.sort((a, b) => (a.

import java.util.Arrays; public class Main { public static void main(String[] args) { int[] array = new int[] {1, 2, 3, 4, 5}; int[] evenArray = Arrays.stream(array) .filter(a -> a % 2 == 0) .to

function twoSum(nums: number[], target: number): number[] { const memo: Record<number, number> = {}; for (let i = 0; i < nums.length; i++) { let diff = target - nums[i]; if (diff in memo) { return [memo[diff], i]

function twoSum(nums: number[], target: number): number[] { const memo: { [key: number]: number } = {}; for (let i = 0; i < nums.length; i++) { let diff = target - nums[i]; if (diff in memo) { return [memo[diff],

function twoSum(nums: number[], target: number): number[] { const memo = new Map<number, number>(); for (let i = 0; i < nums.length; i++) { const diff: number = target - nums[i]; if (memo.has(diff)) { return

async function doRequest() { let url = 'http://webcode.me'; let res = await fetch(url); if (res.ok) { let text = await res.text(); return text; } else { return `HTTP error: ${res.status}`; }