Programming & Software Q&A | CollectiveSolver - Recent questions and answers

Answered: How to find A and B where A and B are prime numbers and A * B = 12349 in C#

Fri, 05 Jun 2026 15:45:45 +0000

using System;

public class FindABProgram
{
    // Function to check if a number is prime
    static bool isPrime(int n)
    {
        if (n <= 1) return false;
        if (n <= 3) return true;
        if (n % 2 == 0 || n % 3 == 0) return false;

        int limit = (int)Math.Sqrt(n);
        for (int i = 5; i <= limit; i += 6) {
            if (n % i == 0 || n % (i + 2) == 0)
                return false;
        }

        return true;
    }

    // Helper class to return A and B together
    class Pair
    {
        public int A, B;
        public Pair(int A, int B)
        {
            this.A = A;
            this.B = B;
        }
    }

    // Function to find the two prime factors A and B
    static Pair findAB(int N)
    {
        int limit = (int)Math.Sqrt(N);

        for (int i = 2; i <= limit; i++) {
            if (N % i == 0) {
                int j = N / i;
                if (isPrime(i) && isPrime(j)) {
                    return new Pair(i, j);
                }
            }
        }

        return new Pair(-1, -1); // No prime factors found
    }

    public static void Main(string[] args)
    {
        int N = 12349;

        Pair result = findAB(N);

        if (result.A != -1)
            Console.WriteLine("A = " + result.A + ", B = " + result.B);
        else
            Console.WriteLine("Not found.");
    }
}



/*
run:

A = 53, B = 233

*/

Answered: How to find A and B where A and B are prime numbers and A * B = 12349 in VB.NET

Fri, 05 Jun 2026 15:13:29 +0000

Imports System

Module FindABProgram

    ' Function to check if a number is prime
    Function isPrime(n As Integer) As Boolean
        If n <= 1 Then Return False
        If n <= 3 Then Return True
        If (n Mod 2 = 0) OrElse (n Mod 3 = 0) Then Return False

        Dim limit As Integer = CInt(Math.Sqrt(n))
        Dim i As Integer = 5

        While i <= limit
            If (n Mod i = 0) OrElse (n Mod (i + 2) = 0) Then
                Return False
            End If
            i += 6
        End While

        Return True
    End Function

    ' Function to find the two prime factors A and B
    Sub findAB(N As Integer, ByRef A As Integer, ByRef B As Integer)
        Dim limit As Integer = CInt(Math.Sqrt(N))

        For i As Integer = 2 To limit
            If N Mod i = 0 Then
                Dim j As Integer = N \ i
                If isPrime(i) AndAlso isPrime(j) Then
                    A = i
                    B = j
                    Exit Sub
                End If
            End If
        Next

        A = -1
        B = -1 ' No prime factors found
    End Sub

    Sub Main()
        Dim N As Integer = 12349
        Dim A As Integer
        Dim B As Integer

        findAB(N, A, B)

        If A <> -1 Then
            Console.WriteLine("A = " & A & ", B = " & B)
        Else
            Console.WriteLine("Not found.")
        End If
    End Sub

End Module

			

' run:
'
' A = 53, B = 233
'

Answered: How to find A and B where A and B are prime numbers and A * B = 12349 in Java

Fri, 05 Jun 2026 13:56:23 +0000

import java.lang.Math;

public class FindABProgram {

    // Function to check if a number is prime
    static boolean isPrime(int n) {
        if (n <= 1) return false;
        if (n <= 3) return true;
        if (n % 2 == 0 || n % 3 == 0) return false;

        int limit = (int)Math.sqrt(n);
        for (int i = 5; i <= limit; i += 6) {
            if (n % i == 0 || n % (i + 2) == 0)
                return false;
        }

        return true;
    }

    // Helper class to return A and B together
    static class Pair {
        int A, B;
        Pair(int A, int B) { this.A = A; this.B = B; }
    }

    // Function to find the two prime factors A and B
    static Pair findAB(int N) {
        int limit = (int)Math.sqrt(N);

        for (int i = 2; i <= limit; i++) {
            if (N % i == 0) {
                int j = N / i;
                if (isPrime(i) && isPrime(j)) {
                    return new Pair(i, j);
                }
            }
        }

        return new Pair(-1, -1); // No prime factors found
    }

    public static void main(String[] args) {
        int N = 12349;

        Pair result = findAB(N);

        if (result.A != -1)
            System.out.println("A = " + result.A + ", B = " + result.B);
        else
            System.out.println("Not found.");
    }
}


/*
run:

A = 53, B = 233

*/

Answered: How to find A and B where A and B are prime numbers and A * B = 12349 in Pascal

Fri, 05 Jun 2026 13:39:35 +0000

program FindABProgram;

{$mode objfpc}

uses
  Math;

// Function to check if a number is prime
function isPrime(n: Integer): Boolean;
var
  limit, i: Integer;
begin
  if n <= 1 then Exit(False);
  if n <= 3 then Exit(True);
  if (n mod 2 = 0) or (n mod 3 = 0) then Exit(False);

  limit := Trunc(Sqrt(n));
  i := 5;
  while i <= limit do
  begin
    if (n mod i = 0) or (n mod (i + 2) = 0) then
      Exit(False);
    Inc(i, 6);
  end;

  Result := True;
end;

// Function to find the two prime factors A and B
procedure findAB(N: Integer; var A, B: Integer);
var
  limit, i, j: Integer;
begin
  limit := Trunc(Sqrt(N));  

  for i := 2 to limit do
  begin
    if (N mod i = 0) then
    begin
      j := N div i;
      if isPrime(i) and isPrime(j) then
      begin
        A := i;
        B := j;
        Exit;
      end;
    end;
  end;

  A := -1;
  B := -1; // No prime factors found
end;

var
  N, A, B: Integer;

begin
  N := 12349;

  findAB(N, A, B);

  if A <> -1 then
    WriteLn('A = ', A, ', B = ', B)
  else
    WriteLn('Not found.');
end.



(*
run:

A = 53, B = 233

*)

Answered: How to find A and B where A and B are prime numbers and A * B = 12349 in C

Fri, 05 Jun 2026 09:23:19 +0000

#include <stdio.h>
#include <math.h>

// Function to check if a number is prime
int isPrime(int n) {
    if (n <= 1) return 0;
    if (n <= 3) return 1;
    if (n % 2 == 0 || n % 3 == 0) return 0;

    int limit = (int)sqrt(n);
    for (int i = 5; i <= limit; i += 6) {
        if (n % i == 0 || n % (i + 2) == 0)
            return 0;
    }
    
    return 1;
}

// Function to find the two prime factors A and B
void findAB(int N, int *A, int *B) {
    int limit = (int)sqrt(N);   

    for (int i = 2; i <= limit; i++) {
        if (N % i == 0) {
            int j = N / i;
            if (isPrime(i) && isPrime(j)) {
                *A = i;
                *B = j;
                return;
            }
        }
    }

    *A = *B = -1; // No prime factors found
}

int main() {
    int N = 12349;
    int A, B;

    findAB(N, &A, &B);

    if (A != -1)
        printf("A = %d, B = %d\n", A, B);
    else
        printf("Not found.\n");

    return 0;
}


/*
run:

A = 53, B = 233

*/

Answered: How to find A and B where A and B are prime numbers and A * B = 12349 in C++

Fri, 05 Jun 2026 09:14:09 +0000

#include <iostream>
#include <cmath>

// Function to check if a number is prime
bool isPrime(int n) {
    if (n <= 1) return false;
    if (n <= 3) return true;
    if (n % 2 == 0 || n % 3 == 0) return false;

    int limit = sqrt(n);
    for (int i = 5; i <= limit; i += 6) {
        if (n % i == 0 || n % (i + 2) == 0)
            return false;
    }
    
    return true;
}

// Function to find the two prime factors A and B
void findAB(int N, int &A, int &B) {
    int limit = sqrt(N);  

    for (int i = 2; i <= limit; i++) {
        if (N % i == 0) {
            int j = N / i;
            if (isPrime(i) && isPrime(j)) {
                A = i;
                B = j;
                return;
            }
        }
    }

    A = B = -1; // No prime factors found
}

int main() {
    int N = 12349;
    int A, B;

    findAB(N, A, B);

    if (A != -1)
        std::cout << "A = " << A << ", B = " << B << std::endl;
    else
        std::cout << "Not found." << std::endl;
}



/*
run:

A = 53, B = 233

*/

Answered: How to create 10 random points in C++

Fri, 05 Jun 2026 08:31:59 +0000

#include <iostream>
#include <random>
#include <vector>

struct Point {
    int x;
    int y;
};

// Generate one random point in [10, 90]
Point generatePoint(std::mt19937& gen, std::uniform_int_distribution<int>& dist) {
    return Point{ dist(gen), dist(gen) };
}

int main() {
    std::random_device rd;
    std::mt19937 gen(rd());
    std::uniform_int_distribution<int> dist(10, 90);

    std::vector<Point> points;

    for (int i = 0; i < 10; ++i) {
        points.push_back(generatePoint(gen, dist));
    }

    for (int i = 0; i < points.size(); i++) {
        std::cout << "Point " << i + 1 << ": ("
                  << points[i].x << ", " << points[i].y << ")\n";
    }
}



/*
run:

Point 1: (54, 25)
Point 2: (26, 40)
Point 3: (47, 41)
Point 4: (20, 33)
Point 5: (72, 36)
Point 6: (10, 85)
Point 7: (80, 65)
Point 8: (80, 82)
Point 9: (44, 43)
Point 10: (22, 81)

*/

Answered: How to create 10 random points in C

Fri, 05 Jun 2026 08:30:25 +0000

#include <stdio.h>
#include <stdlib.h>
#include <time.h>

typedef struct {
    int x;
    int y;
} Point;

// Generate one random point in [10, 90]
Point generatePoint() {
    Point p;
    p.x = rand() % 81 + 10;  // 10–90
    p.y = rand() % 81 + 10;  // 10–90
    return p;
}

int main() {
    srand(time(NULL));  // Seed RNG

    Point points[10];

    for (int i = 0; i < 10; i++) {
        points[i] = generatePoint();
    }

    for (int i = 0; i < 10; i++) {
        printf("Point %d: (%d, %d)\n", i + 1, points[i].x, points[i].y);
    }

    return 0;
}



/*
run:

Point 1: (49, 66)
Point 2: (47, 52)
Point 3: (80, 57)
Point 4: (62, 36)
Point 5: (66, 10)
Point 6: (40, 62)
Point 7: (64, 22)
Point 8: (16, 82)
Point 9: (89, 63)
Point 10: (56, 37)

*/

Answered: How to create a first-class function in C++

Fri, 05 Jun 2026 07:33:06 +0000

#include <iostream>
#include <functional>   // std::function

// What a first‑class function does:
// It can be stored in a variable
// It can be passed to another function
// It can be returned from a function
// It can capture variables (if it’s a lambda)
// It allows dynamic behavior

// A first‑class function in C++ is created by treating a function as a value
// something you can store in a variable, pass to another function, or return from a function.
// In modern C++, the cleanest way to do this is with std::function, function pointers, or lambdas.

// A normal function
int add(int a, int b) {
    return a + b;
}

// A function that *accepts* a first-class function
// std::function<int(int,int)> means: a callable taking (int,int) → int
void applyOperation(const std::function<int(int,int)>& op) {
    std::cout << "Result: " << op(10, 5) << std::endl;
}

// A function that *returns* a first-class function
std::function<int(int,int)> getMultiplier(int factor) {
    // Return a lambda that captures 'factor'
    return [factor](int a, int b) {
        return factor * (a + b);
    };
}

int main() {
    // 1. Store a normal function as a first-class function
    std::function<int(int,int)> f1 = add;
    std::cout << "add(3,4) = " << f1(3,4) << std::endl;

    // 2. Store a lambda as a first-class function
    std::function<int(int,int)> f2 = [](int a, int b) {
        return a * b;
    };
    std::cout << "lambda multiply = " << f2(3,4) << std::endl;

    // 3. Pass a first-class function to another function
    applyOperation(add);      // passing normal function
    applyOperation(f2);       // passing lambda

    // 4. Return a first-class function from a function
    auto tripleAdder = getMultiplier(3);
    std::cout << "tripleAdder(2,3) = " << tripleAdder(2,3) << std::endl;
}


/*
run:

add(3,4) = 7
lambda multiply = 12
Result: 15
Result: 50
tripleAdder(2,3) = 15

*/

Answered: How to represent the ABCs as a 5-letter binary code using A for 0 and B for 1 in PHP

Fri, 05 Jun 2026 07:08:53 +0000

// a = AAAAA -> 00000 -> 0
// b = AAAAB -> 00001 -> 1
// c = AAABA -> 00010 -> 2
// d = AAABB -> 00011 -> 3
// e = AABAA -> 00100 -> 4
// f = AABAB -> 00101 -> 5
// g = AABBA -> 00110 -> 6

// Convert integer n (0–31) into 5-letter A/B code
function toAB($n) {
    $out = "";

    for ($i = 4; $i >= 0; $i--) {
        $bit = ($n >> $i) & 1;   // extract bit
        $out .= ($bit == 1 ? 'B' : 'A');
    }

    return $out;
}

for ($ch = ord('a'); $ch <= ord('z'); $ch++) {
    $char = chr($ch);
    $value = $ch - ord('a');      // a=0, b=1, c=2...
    $code = toAB($value);

    echo $char . " -> " . $value . " -> " . $code . "\n";
}


/*
run:

a -> 0 -> AAAAA
b -> 1 -> AAAAB
c -> 2 -> AAABA
d -> 3 -> AAABB
e -> 4 -> AABAA
f -> 5 -> AABAB
g -> 6 -> AABBA
h -> 7 -> AABBB
i -> 8 -> ABAAA
j -> 9 -> ABAAB
k -> 10 -> ABABA
l -> 11 -> ABABB
m -> 12 -> ABBAA
n -> 13 -> ABBAB
o -> 14 -> ABBBA
p -> 15 -> ABBBB
q -> 16 -> BAAAA
r -> 17 -> BAAAB
s -> 18 -> BAABA
t -> 19 -> BAABB
u -> 20 -> BABAA
v -> 21 -> BABAB
w -> 22 -> BABBA
x -> 23 -> BABBB
y -> 24 -> BBAAA
z -> 25 -> BBAAB

*/

Answered: How to write a multiple‑choice question implemented in COBOL

Fri, 05 Jun 2026 06:30:23 +0000

       IDENTIFICATION DIVISION.
       PROGRAM-ID. MCQ-COBOL.

       DATA DIVISION.
       WORKING-STORAGE SECTION.
       01 USER-ANSWER PIC A(1).        *> Stores the user's choice

       PROCEDURE DIVISION.
           DISPLAY "Multiple-Choice Question:"
           DISPLAY "What does COBOL stand for?"
           DISPLAY "A. Common Business-Oriented Language"
           DISPLAY "B. Computer Binary Operating Logic"
           DISPLAY "C. Central Business Operations Layer"
           DISPLAY "D. Code Base Optimization Language"
           DISPLAY " "
           DISPLAY "Enter your answer (A/B/C/D): "
           ACCEPT USER-ANSWER

           IF USER-ANSWER = "A"
               DISPLAY "Correct! COBOL means Common Business-Oriented Language."
           ELSE
               DISPLAY "Incorrect. The correct answer is A."
           END-IF

           STOP RUN.



    *> run:
    *>
    *> Multiple-Choice Question:
    *> What does COBOL stand for?
    *> A. Common Business-Oriented Language
    *> B. Computer Binary Operating Logic
    *> C. Central Business Operations Layer
    *> D. Code Base Optimization Language
    *>
    *> Enter your answer (A/B/C/D): 
    *> A
    *> Correct! COBOL means Common Business-Oriented Language.
    *>

Answered: How to input an age in COBOL

Thu, 04 Jun 2026 18:17:09 +0000

       IDENTIFICATION DIVISION.
       PROGRAM-ID. ASK-AGE.
       DATA DIVISION.
       WORKING-STORAGE SECTION.
       01 AGE PIC 99.
       PROCEDURE DIVISION.
           DISPLAY "How old are you?"
           ACCEPT AGE
           DISPLAY "You are " AGE " years old."
           STOP RUN.

            
            
        *> run:
        *> 
        *> How old are you?
        *> 42
        *> You are 42 years old.
        *>

Answered: How to input a name in COBOL

Thu, 04 Jun 2026 17:08:38 +0000

        IDENTIFICATION DIVISION.
        PROGRAM-ID. ASK-NAME.
        DATA DIVISION.
        WORKING-STORAGE SECTION.
        01 USER-NAME PIC A(20).
        PROCEDURE DIVISION.
            DISPLAY "What is your name?"        *> Question
            ACCEPT USER-NAME                    *> Read input
            DISPLAY "Hello, " USER-NAME "!"     *> Answer
            STOP RUN.
            
            
        *> run:
        *> 
        *> What is your name?
        *> Avi
        *> Hello, Avi 
        *>

Answered: How to use higher-order functions in Swift

Thu, 04 Jun 2026 15:30:43 +0000

// A higher‑order function is a function that does at least one of the following:
// 1. Takes another function as an argument
// 2. Returns a function as its result
// If it does either one, it qualifies.

// makeMultiplier is a higher‑order function because it RETURNS another function
func makeMultiplier(_ n: Int) -> (Int) -> Int {

    // This inner function forms a closure and remembers the value of n
    return { x in
        return x * n // Uses the captured value n
    }
}

// double_val is now a function created by makeMultiplier(2)
// It remembers n = 2 through closure
let double_val = makeMultiplier(2)

// Calling double_val(10) multiplies 10 by the captured n (which is 2)
print(double_val(10))



/*
run:

20

*/

Answered: How to use higher-order functions in Kotlin

Thu, 04 Jun 2026 15:25:06 +0000

// A higher‑order function is a function that does at least one of the following:
// 1. Takes another function as an argument
// 2. Returns a function as its result
// If it does either one, it qualifies.

// makeMultiplier is a higher‑order function because it RETURNS another function
fun makeMultiplier(n: Int): (Int) -> Int {

    // This inner function forms a closure and remembers the value of n
    return { x: Int ->
        x * n // Uses the captured value n
    }
}

fun main() {
    // double_val is now a function created by makeMultiplier(2)
    // It remembers n = 2 through closure
    val double_val = makeMultiplier(2)

    // Calling double_val(10) multiplies 10 by the captured n (which is 2)
    println(double_val(10))
}



/*
run:

20

*/

Answered: How to use higher-order functions in Scala

Thu, 04 Jun 2026 15:14:22 +0000

// A higher‑order function is a function that does at least one of the following:
// 1. Takes another function as an argument
// 2. Returns a function as its result
// If it does either one, it qualifies.

// makeMultiplier is a higher‑order function because it RETURNS another function
def makeMultiplier(n: Int): Int => Int =

  // This inner function forms a closure and remembers the value of n
  (x: Int) => x * n // Uses the captured value n

@main def runExample2(): Unit =
  // double_val is now a function created by makeMultiplier(2)
  // It remembers n = 2 through closure
  val double_val = makeMultiplier(2)

  // Calling double_val(10) multiplies 10 by the captured n (which is 2)
  println(double_val(10))
  
  

/*
run:

20

*/

Answered: How to use higher-order functions in Ruby

Thu, 04 Jun 2026 13:31:26 +0000

# A higher‑order function is a function that does at least one of the following:
# 1. Takes another function as an argument
# 2. Returns a function as its result
# If it does either one, it qualifies.

# makeMultiplier is a higher‑order function because it RETURNS another function
def make_multiplier(n)

  # This inner function forms a closure and remembers the value of n
  return ->(x) { x * n } # Uses the captured value n
end

# double_val is now a function created by makeMultiplier(2)
# It remembers n = 2 through closure
double_val = make_multiplier(2)

# Calling double_val(10) multiplies 10 by the captured n (which is 2)
puts double_val.call(10)



=begin
run:

20

=end

Answered: How to use higher-order functions in Rust

Thu, 04 Jun 2026 09:47:10 +0000

// A higher‑order function is a function that does at least one of the following:
// 1. Takes another function as an argument
// 2. Returns a function as its result
// If it does either one, it qualifies.

// makeMultiplier is a higher‑order function because it RETURNS another function
fn make_multiplier(n: i32) -> impl Fn(i32) -> i32 {

    // This inner function forms a closure and remembers the value of n
    move |x| x * n // Uses the captured value n
}

fn main() {
    // double_val is now a function created by makeMultiplier(2)
    // It remembers n = 2 through closure
    let double_val = make_multiplier(2);

    // Calling double_val(10) multiplies 10 by the captured n (which is 2)
    println!("{}", double_val(10));
}


/*
run:

20

*/

Answered: How to use higher-order functions in Go

Thu, 04 Jun 2026 09:40:58 +0000

package main

import "fmt"

// A higher‑order function is a function that does at least one of the following:
// 1. Takes another function as an argument
// 2. Returns a function as its result
// If it does either one, it qualifies.

// makeMultiplier is a higher‑order function because it RETURNS another function
func makeMultiplier(n int) func(int) int {

    // This inner function forms a closure and remembers the value of n
    return func(x int) int {
        return x * n // Uses the captured value n
    }
}

func main() {

    // double_val is now a function created by makeMultiplier(2)
    // It remembers n = 2 through closure
    double_val := makeMultiplier(2)

    // Calling double_val(10) multiplies 10 by the captured n (which is 2)
    fmt.Println(double_val(10))
}



/*
run:

20

*/

Answered: How to use higher-order functions in Python

Thu, 04 Jun 2026 09:05:00 +0000

# A higher‑order function is a function that does at least one of the following:
# 1. Takes another function as an argument
# 2. Returns a function as its result
# If it does either one, it qualifies.

# makeMultiplier is a higher‑order function because it RETURNS another function
def makeMultiplier(n):

    # This inner function forms a closure and remembers the value of n
    def inner(x):
        return x * n  # Uses the captured value n

    return inner

# double_val is now a function created by makeMultiplier(2)
# It remembers n = 2 through closure
double_val = makeMultiplier(2)

# Calling double_val(10) multiplies 10 by the captured n (which is 2)
print(double_val(10))


"""
run:

20

"""

Answered: How to use higher-order functions in PHP

Thu, 04 Jun 2026 08:58:18 +0000

// A higher‑order function is a function that does at least one of the following:
// 1. Takes another function as an argument
// 2. Returns a function as its result
// If it does either one, it qualifies.

// Higher-order function: takes a function as an argument
function applyTwice(callable $fn, int $x): int {
    return $fn($fn($x));
}

// A simple function to pass in
function add3(int $n): int {
    return $n + 3;
}

// Use the higher-order function
$result = applyTwice('add3', 5); // 5 + 3 = 8 + 3 = 11

echo $result . PHP_EOL;


/*
run:

11

*/

Answered: How to use higher-order functions in TypeScript

Thu, 04 Jun 2026 08:53:00 +0000

// A higher‑order function is a function that does at least one of the following:
// 1. Takes another function as an argument
// 2. Returns a function as its result
// If it does either one, it qualifies.

// makeMultiplier is a higher‑order function because it RETURNS another function
function makeMultiplier(n: number): (x: number) => number {

    // This inner function forms a closure and remembers the value of n
    return function (x: number): number {
        return x * n; // Uses the captured value n
    };
}

// double_val is now a function created by makeMultiplier(2)
// It remembers n = 2 through closure
const double_val = makeMultiplier(2);

// Calling double_val(10) multiplies 10 by the captured n (which is 2)
console.log(double_val(10));



/*
run:

20

*/

Answered: How to use higher-order functions in C#

Thu, 04 Jun 2026 08:46:01 +0000

using System;

class Program
{
    // A higher‑order function is a function that does at least one of the following:
    // 1. Takes another function as an argument
    // 2. Returns a function as its result
    // If it does either one, it qualifies.

    // makeMultiplier is a higher‑order function because it RETURNS another function
    static Func<int, int> makeMultiplier(int n) {
        // This inner function forms a closure and remembers the value of n
        return (int x) => x * n; // Uses the captured value n
    }

    static void Main()
    {
        // double is now a function created by makeMultiplier(2)
        // It remembers n = 2 through closure
        var doubleFn = makeMultiplier(2);

        // Calling doubleFn(10) multiplies 10 by the captured n (which is 2)
        Console.WriteLine(doubleFn(10));
    }
}



/*
run:

20

*/

Answered: How to use higher-order functions in VB.NET

Thu, 04 Jun 2026 05:52:08 +0000

Imports System

Module Program

    ' A higher‑order function is a function that does at least one of the following:
    ' 1. Takes another function as an argument
    ' 2. Returns a function as its result
    ' If it does either one, it qualifies.

    ' makeMultiplier is a higher‑order function because it RETURNS another function
    Function makeMultiplier(n As Integer) As Func(Of Integer, Integer)

        ' This inner function forms a closure and remembers the value of n
        Return Function(x As Integer) x * n ' Uses the captured value n

    End Function

    Sub Main()

        ' double is now a function created by makeMultiplier(2)
        ' It remembers n = 2 through closure
        Dim doubleFn As Func(Of Integer, Integer) = makeMultiplier(2)

        ' Calling doubleFn(10) multiplies 10 by the captured n (which is 2)
        Console.WriteLine(doubleFn(10))
    End Sub

End Module


	
' run:
'
' 20
'

Answered: How to use higher-order functions in Java

Thu, 04 Jun 2026 05:48:30 +0000

import java.util.function.Function;

public class ProgramClass {

    // A higher‑order function is a function that does at least one of the following:
    // 1. Takes another function as an argument
    // 2. Returns a function as its result
    // If it does either one, it qualifies.

    // makeMultiplier is a higher‑order function because it RETURNS another function
    static Function<Integer, Integer> makeMultiplier(int n) {

        // This inner function forms a closure and remembers the value of n
        return (Integer x) -> x * n; // Uses the captured value n
    }

    public static void main(String[] args) {

        // double is now a function created by makeMultiplier(2)
        // It remembers n = 2 through closure
        Function<Integer, Integer> doubleFn = makeMultiplier(2);

        // Calling doubleFn.apply(10) multiplies 10 by the captured n (which is 2)
        System.out.println(doubleFn.apply(10));
    }
}



/*
run:

20

*/

Answered: How to use higher-order functions in C

Wed, 03 Jun 2026 17:26:35 +0000

#include <stdio.h>

// A higher‑order function is a function that does at least one of the following:
// 1. Takes another function as an argument
// 2. Returns a function as its result
// If it does either one, it qualifies.

// We simulate a closure using a struct that stores state + a function pointer
typedef struct {
    int n;                       // captured value
    int (*fn)(int x, int n);     // function pointer that uses captured value
} Multiplier;

// Function used by the "closure"
int multiplyImpl(int x, int n) {
    return x * n; // Uses the captured value n
}

// makeMultiplier is a higher‑order function because it RETURNS another function-like object
Multiplier makeMultiplier(int n) {

    // This inner function forms a closure and remembers the value of n
    Multiplier m;
    m.n = n;
    m.fn = multiplyImpl;
    
    return m;
}

int main() {
    // double is now a function-like object created by makeMultiplier(2)
    // It remembers n = 2 through stored state
    Multiplier doubleFn = makeMultiplier(2);

    // Calling doubleFn.fn(10, doubleFn.n) multiplies 10 by the captured n (which is 2)
    printf("%d\n", doubleFn.fn(10, doubleFn.n));

    return 0;
}



/*
run:

20

*/

Answered: How to use higher-order functions in C++

Wed, 03 Jun 2026 16:52:28 +0000

#include <iostream>
#include <functional>

// A higher‑order function is a function that does at least one of the following:
// 1. Takes another function as an argument
// 2. Returns a function as its result
// If it does either one, it qualifies.

// makeMultiplier is a higher‑order function because it RETURNS another function
std::function<int(int)> makeMultiplier(int n) {

    // This inner function forms a closure and remembers the value of n
    return [n](int x) {
        return x * n; // Uses the captured value n
    };
}

int main() {
    // double is now a function created by makeMultiplier(2)
    // It remembers n = 2 through closure
    auto doubleFn = makeMultiplier(2);

    // Calling doubleFn(10) multiplies 10 by the captured n (which is 2)
    std::cout << doubleFn(10) << std::endl;
}



/*
run:

20

*/

Answered: How to use higher-order functions in JavaScript

Wed, 03 Jun 2026 16:28:59 +0000

// A higher‑order function is a function that does at least one of the following:
// 1. Takes another function as an argument
// 2. Returns a function as its result
// If it does either one, it qualifies.
 
// makeMultiplier is a higher‑order function because it RETURNS another function
function makeMultiplier(n) {
 
    // This inner function forms a closure and remembers the value of n
    return function(x) {
        return x * n; // Uses the captured value n
    };
}
 
// double_val is now a function created by makeMultiplier(2)
// It remembers n = 2 through closure
const double_val = makeMultiplier(2);
 
// Calling double_val(10) multiplies 10 by the captured n (which is 2)
console.log(double_val(10));
 
 
/*
run:
 
20
 
*/

Answered: How to represent the ABCs as a 5-letter binary code using A for 0 and B for 1 in Java

Wed, 03 Jun 2026 15:50:23 +0000

// a = AAAAA -> 00000 -> 0
// b = AAAAB -> 00001 -> 1
// c = AAABA -> 00010 -> 2
// d = AAABB -> 00011 -> 3
// e = AABAA -> 00100 -> 4
// f = AABAB -> 00101 -> 5
// g = AABBA -> 00110 -> 6

public class ABCode {

    // Convert integer n (0–31) into 5-letter A/B code
    static String toAB(int n) {
        StringBuilder out = new StringBuilder();

        for (int i = 4; i >= 0; --i) {
            int bit = (n >> i) & 1;   // extract bit
            out.append(bit == 1 ? 'B' : 'A');
        }

        return out.toString();
    }

    public static void main(String[] args) {
        for (char ch = 'a'; ch <= 'z'; ++ch) {
            int value = ch - 'a';      // a=0, b=1, c=2...
            String code = toAB(value);

            System.out.println(ch + " -> " + value + " -> " + code);
        }
    }
}


/*
run:

a -> 0 -> AAAAA
b -> 1 -> AAAAB
c -> 2 -> AAABA
d -> 3 -> AAABB
e -> 4 -> AABAA
f -> 5 -> AABAB
g -> 6 -> AABBA
h -> 7 -> AABBB
i -> 8 -> ABAAA
j -> 9 -> ABAAB
k -> 10 -> ABABA
l -> 11 -> ABABB
m -> 12 -> ABBAA
n -> 13 -> ABBAB
o -> 14 -> ABBBA
p -> 15 -> ABBBB
q -> 16 -> BAAAA
r -> 17 -> BAAAB
s -> 18 -> BAABA
t -> 19 -> BAABB
u -> 20 -> BABAA
v -> 21 -> BABAB
w -> 22 -> BABBA
x -> 23 -> BABBB
y -> 24 -> BBAAA
z -> 25 -> BBAAB

*/

Answered: How to represent the ABCs as a 5-letter binary code using A for 0 and B for 1 in Pascal

Wed, 03 Jun 2026 15:46:51 +0000

program ABCode;

{$mode objfpc}

// a = AAAAA -> 00000 -> 0
// b = AAAAB -> 00001 -> 1
// c = AAABA -> 00010 -> 2
// d = AAABB -> 00011 -> 3
// e = AABAA -> 00100 -> 4
// f = AABAB -> 00101 -> 5
// g = AABBA -> 00110 -> 6

// Convert integer n (0–31) into 5-letter A/B code
function toAB(n: Integer): string;
var
  i, bit: Integer;
  outStr: string;
begin
  outStr := '';
  for i := 4 downto 0 do
  begin
    bit := (n shr i) and 1;       // extract bit
    if bit = 1 then
      outStr := outStr + 'B'
    else
      outStr := outStr + 'A';
  end;
  Result := outStr;
end;

var
  ch: Char;
  value: Integer;
  code: string;

begin
  for ch := 'a' to 'z' do
  begin
    value := Ord(ch) - Ord('a');   // a=0, b=1, c=2...
    code := toAB(value);

    WriteLn(ch, ' -> ', value, ' -> ', code);
  end;
end.


(*
run:

a -> 0 -> AAAAA
b -> 1 -> AAAAB
c -> 2 -> AAABA
d -> 3 -> AAABB
e -> 4 -> AABAA
f -> 5 -> AABAB
g -> 6 -> AABBA
h -> 7 -> AABBB
i -> 8 -> ABAAA
j -> 9 -> ABAAB
k -> 10 -> ABABA
l -> 11 -> ABABB
m -> 12 -> ABBAA
n -> 13 -> ABBAB
o -> 14 -> ABBBA
p -> 15 -> ABBBB
q -> 16 -> BAAAA
r -> 17 -> BAAAB
s -> 18 -> BAABA
t -> 19 -> BAABB
u -> 20 -> BABAA
v -> 21 -> BABAB
w -> 22 -> BABBA
x -> 23 -> BABBB
y -> 24 -> BBAAA
z -> 25 -> BBAAB

*)

Answered: How to use closure in Swift

Wed, 03 Jun 2026 15:39:34 +0000

// Closures inside higher‑order functions

let nums: [Int] = [1, 2, 3]
let factor: Int = 2

// map uses a closure that captures "factor"
let doubled: [Int] = nums.map { $0 * factor }

print(doubled)


/*
run:

[2, 4, 6]

*/

How to use closure in Kotlin

Wed, 03 Jun 2026 04:56:54 +0000

How to use closure in Scala

Wed, 03 Jun 2026 04:32:54 +0000

How to use closure in Ruby

Tue, 02 Jun 2026 16:03:29 +0000

How to use closure in Go

Tue, 02 Jun 2026 15:50:12 +0000

How to use closure in TypeScript

Tue, 02 Jun 2026 15:40:23 +0000

How to use closure in JavaScript

Tue, 02 Jun 2026 15:33:15 +0000

How to use closure in Java

Tue, 02 Jun 2026 13:10:28 +0000

How to use closure in C++

Tue, 02 Jun 2026 09:24:29 +0000

How to use an anonymous function in Swift

Tue, 02 Jun 2026 09:12:12 +0000

How to use an anonymous function in Kotlin

Tue, 02 Jun 2026 08:40:31 +0000

How to use an anonymous function in Scala

Tue, 02 Jun 2026 08:20:33 +0000

How to use an anonymous function in Ruby

Tue, 02 Jun 2026 08:14:19 +0000

How to use an anonymous function in Rust

Tue, 02 Jun 2026 08:08:59 +0000

How to use an anonymous function in TypeScript

Tue, 02 Jun 2026 07:57:03 +0000

How to use an anonymous function in JavaScript

Tue, 02 Jun 2026 07:49:17 +0000

How to use an anonymous function in C#

Tue, 02 Jun 2026 07:47:04 +0000

How to use an anonymous function in VB.NET

Tue, 02 Jun 2026 07:44:50 +0000

How to use an anonymous function in Java

Tue, 02 Jun 2026 06:47:38 +0000

How to use an anonymous function in C++

Tue, 02 Jun 2026 06:42:08 +0000