algorithm

[Solved] Algorithm for quantity selection [closed]

by

You should have a Product class. Each product object has different quantity measures and increment methods. Something like this: public abstract class Product { String quantityMeasure; //You can encapsulate this with a getter public abstract int step (int value); //here you want to increment “value” with different algorithms. } Now you can create different product … Read more

[Solved] Difference between 2 floats [closed]

by

The result is correct. Try to visualize it: Distance between -110 and 100 is the sum of distance between -110 and 0 (Mathf.Abs(-110 – 0) = 110) and distance between 100 and 0 (Mathf.Abs(100 – 0) = 100). That is: 110 + 100 = 210. Perhaps you have a different operation in mind? If you … Read more

[Solved] Describe the algorithm to swap two adjacent elements by adjusting only the links (and not the data) using: a, singling link list b, doubling link list

by

Describe the algorithm to swap two adjacent elements by adjusting only the links (and not the data) using: a, singling link list b, doubling link list solved Describe the algorithm to swap two adjacent elements by adjusting only the links (and not the data) using: a, singling link list b, doubling link list

[Solved] How to concatenate two arrays into 1 single array using java? [duplicate]

by

Make a for-loop an iterate over Array1 and Array2 Do Integer.parseInt(String.valueOf(Array1[i])+String.valueOf(Array2[i])); Fill the Array3 in the for-loop with the calculated valued. That’s it. int[] Array1 = new int[] {3,3,3}; int[] Array2 = new int[] {3,2,1}; int[] Array3 = new int[Array2.length]; for(int i = 0; i<Array1.length; i++) { Array3[i] = Integer.parseInt(String.valueOf(Array1[i])+String.valueOf(Array2[i])); } Output: Array3[] = {33,32,31} … Read more

[Solved] Does this algorithm have a name? [closed]

by

They all seem to be examples of linear search. According to the Wikipedia article: It sequentially checks each element of the list for the target value until a match is found or until all the elements have been searched. 7 solved Does this algorithm have a name? [closed]

[Solved] Alphanumeric increment algorithm in JAVA [closed]

by

Here’s 3 solutions: the first two are somewhat arithmetic incrementations while the third is more a character manipulations. The 3 implementations all pass the same unit tests: assertEquals(“1DDA01A”, MyClass.increment(“1DDA00Z”)); assertEquals(“1A9AV00”, MyClass.increment(“1A9AU99”)); assertEquals(“AFH00”, MyClass.increment(“AFG99”)); assertEquals(“A2GF24”, MyClass.increment(“A2GF23”)); assertEquals(“ABAA0000”, MyClass.increment(“AAZZ9999”)); assertEquals(“11AB0A”, MyClass.increment(“11AA9Z”)); First: public static String increment(String number) { Pattern compile = Pattern.compile(“^(.*?)([9Z]*)$”); Matcher matcher = compile.matcher(number); String … Read more

[Solved] Fastest (least execution time) approach to get max/min of an array of int without inbuilt functions except range() and len() [closed]

by

Fastest (least execution time) approach to get max/min of an array of int without inbuilt functions except range() and len() [closed] solved Fastest (least execution time) approach to get max/min of an array of int without inbuilt functions except range() and len() [closed]