All Questions

I've been asked to find the best and worst case time complexity "in terms of their running time as a function of input size, n." I'm pretty new to Big O but I was doing okay will the other ...

I have the following function handle uppercase K and array of lowercase k and gamma values. N = 3; k = randi([1,1000],N+1,1,"double"); gamma = randi([1,100],N+1,1,"double"); K = @...

I have the following matrix C that I would like to recreate in MATLAB: In this case uppercase C is an N = 3 by N = 3 matrix, but I would like to generate C for any size of N by N. I randomly create ...

I'm working on a project that involves processing a large dataset with nested loops, and I'm struggling to optimize my code for maximum efficiency. Here's my current approach, which I know is not ...

I have a Python code that efficiently solves my task, but I'm concerned about its time complexity. The task is to find the number of index pairs (i, j) where the inequality aᵢ ⊕ aʲ ≥ bᵢ ⊕ bʲ holds ...

i'm doing a code challenge for funzies and trying to determine the time complexity of my solution. it's been a minute since college so i want to confirm i'm doing this analysis correctly. here's the ...

I have this problem to solve: Given a 2N x 2N matrix of integers, you are allowed to reverse any row or column any number of times and in any order. The task is to calculate the maximum sum of the ...

I'm a beginner here studying algorithms for the first time. I'd like to know the running time of the following algorithm with 3 nested for loops. I know in most cases it's the lengths of the loops ...

I made a program to remove duplicate elements in an array, but it is not working correctly. Can someone help me with it? When I input 1,1,1,2,3 it displays 1,1,2,3. It works fine with other inputs, ...

I have 4 nested loops in my Python code and it takes ages to finish all the loops when the grids are big. For example, here is a piece of my code: from itertools import product T = 50 beta ...

Am a beginner in C and I came across this question, How to produce the following pattern using C nested loops BBBBBBB BBBBBB BBBBB BBBB BBB BB Code # include <stdio.h> int main() { int Row, ...

function compressBoxesTwice(box1, box2) { box1.forEach(function (boxes) { console.log(box1); box2.forEach(function (boxes) { console.log(box2); }) }) } compressBoxesTwice(); ...

What is the time complexity of this? The outer loop is O(log n). But I am not sure about the inner loop? Is it O(log n) also? Would that make this entire algorithm O(n log n)? while (n > 0) { ...

there is no output for the code when the input exceeds two. import java.util.Scanner; class PrimeNumberFinder { static boolean is_prime(int number ,int[] prime_numbers) { boolean is_prime =...

Given the following problem: You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that ...