All Questions
499
questions
2
votes
1
answer
69
views
Research program for examining array list arithmetic contractions
Introduction
Suppose we have a dynamic table \$T\$. Let \$\vert T \vert\$ denote the number of elements currently stored in \$T\$, and \$\vert \vert T \vert \vert\$ denote the capacity of \$T\$. Also, ...
- 28.6k
4
votes
3
answers
249
views
Given two sparse vectors, compute their dot product
Problem Statement:
Given two sparse vectors, compute their dot product.
Implement class SparseVector:
SparseVector(nums) Initializes the object with the vector nums
dotProduct(vec) Compute the dot ...
- 81
1
vote
3
answers
112
views
Another ATMs cash-out (denomination) algorithm in Java
Related to this question and this answer, I would like to have a second review from you on a modified version.
The problem I tried to solve
Some kind of "Minimum count of numbers required from ...
- 490
2
votes
1
answer
78
views
Implementing an improved merge sort that uses insertion sort, with "levels" - Would this work correctly?
We were asked to improve the merge sort algorithm by introducing insertion sort to the code. We have been tasked with doing this by utilising a "levels" logic. Here is the exact description ...
- 21
1
vote
1
answer
90
views
Shrink an array of double elements (uniformly)
Is there a way to avoid the first loop in the method shrink? (if and while...)
The utility ...
- 490
3
votes
2
answers
202
views
Counting duplicate elements in two sorted arrays
I've been working on an assignment that involves optimizing a duplicate finding algorithm for sorted arrays, and I'd like to get your thoughts on the implementation. Here's the code I've come up with:
...
- 31
0
votes
1
answer
56
views
The Matrix Winds In
The Problem: Given an N by M Matrix, Create an Anti-Clockwise Traversal Path that winds in all the way into the Matrix
Example: The Matrix is 9 by 5
Output:
...
2
votes
2
answers
189
views
Quick Sort Program
Quick sort is a sorting algorithm in which we select any random element as pivot from the array and we do the partition of the array around that pivot. Basically we place all the elements smaller than ...
0
votes
1
answer
103
views
Printing Permutations
Following is a leetcode problem:
Given an array nums of distinct integers, return all the possible permutations. You can return all the possible permutations. You can return the answer in any order.
...
4
votes
2
answers
238
views
Robust input for lottery tickets
I've made a method that provides a robust way for a user to fill out a lottery ticket. During this process I found out that Java also provides syntax for labels. That was very astounding for me. But I ...
- 2,174
2
votes
1
answer
94
views
Multidimensional array in Java
I have this multidimensional array that generalizes vectors and matrices:
com.github.coderodde.util.MultidimensionalArray.java:
...
- 28.6k
1
vote
1
answer
96
views
Selection algorithms (order statistic) in Java: linear time vs. sorting selector vs. Quickselect
This post is about computing order statistics: given an array \$A\$ (not necessarily sorted), find the \$k\$th smallest array component. The entire repository is here.
...
- 28.6k
1
vote
1
answer
83
views
Java - Select the maximum integers from sliding windows over an array
So I have the following algorithm. Given an array A[0 ... n - 1] and the window length w, compute all the windows ...
- 28.6k
4
votes
1
answer
935
views
Writing a Java program that outputs a calorie/macronutrient plan for getting in shape over a certain amount of weeks
I am new to programming and was working on a project that calculates an entire "diet plan" as well as a projected weight goal for each week.
There are three objects that all have methods ...
4
votes
1
answer
183
views
Langton's Ant cellular automaton in Java
I made a couple of little games and cellular automata in Java. For every new 'game', I used the same code as a base, except for the game logic of course. With every iteration of me customizing my ...
- 41