Algorithms - Revision history

Leksy at 15:13, 13 November 2022

2022-11-13T15:13:32Z

2022-10-27T15:36:47Z

Sum of two numbers

2022-10-27T15:34:28Z

2022-10-27T15:34:11Z

2022-10-26T05:47:42Z

2022-10-26T03:29:51Z

2022-10-25T16:44:11Z

2022-10-25T16:43:42Z

Java Graph Implementation with Search Methods

2022-10-25T16:41:33Z

2022-10-25T16:14:10Z

Computing number combinations

@@ Line 746: / Line 746: @@
          int target = 18;
          System.out.println(Arrays.toString(TwoThatAdd.showAdded(options, target)));
+     }
+}

@@ Line 646: / Line 646: @@
 ==Sum of two numbers==
 Are there two numbers in the provided set that add up to the given number?
 import java.util.HashSet;
@@ Line 680: / Line 683: @@
+     }
+}
 ==Find two numbers that add up==
 You have a set of numbers and another number (target) that is comprised of two numbers in the set added up. How do you find if there are two numbers in the set that add up?

← Older revision		Revision as of 15:34, 27 October 2022
Line 1:		Line 1:
−	Below is a collection of algorithms. The title of the algorithm describes (as much as possible) what the algorithm does	+	Below is a collection of algorithms. The title of the algorithm describes (as much as possible) what the algorithm does.

	==Java Graph Implementation with Search Methods==		==Java Graph Implementation with Search Methods==

← Older revision		Revision as of 15:34, 27 October 2022
Line 1:		Line 1:
		+	Below is a collection of algorithms. The title of the algorithm describes (as much as possible) what the algorithm does
		+
	==Java Graph Implementation with Search Methods==		==Java Graph Implementation with Search Methods==

@@ Line 676: / Line 676: @@
+         }
+     }
+}

@@ Line 640: / Line 640: @@
              System.out.println(denomination);
+         }
+     }
+}

← Older revision		Revision as of 16:44, 25 October 2022
Line 46:		Line 46:

	Short Nephew, id 109, is in Legal and reports to Grace Marks.		Short Nephew, id 109, is in Legal and reports to Grace Marks.
		+

	import java.util.HashMap;		import java.util.HashMap;

@@ Line 4: / Line 4: @@
 Jimbo Jones is employee id 38 and is the President.
 Mike McCobb, id 39, is a VP and reports to Jimbo Jones.
 Elda Two, id 43, is a VP and reports to Jimbo Jones.
 Simon Sneath, id 48, is a VP and reports to Jimbo Jones.
 Tim Scott, id 56, is a Manager and reports to Mike McCobb.
 Bob Tilman, id 58, is a Manager and reports to Mike McCobb.
 Andrew Cole, id 78, is an Analyst and reports to Tim Scott.
 Matt Lemon, id 83, is an Analyst and reports to Tim Scott.
 Chris Lock, id 88, is an Analyst and reports to Tim Scott.
 Agnes White, id 71, is an Accountant and reports to Bob Tilman.
 George Mills, id 61, is a Manager and reports to Elda Two.
 Thomas Wells, id 59, is a Manager and reports to Elda Two.
 Zip Two, id 63, is Manager and also reports to Elda Two.
 Rasta Him, id 73, is a Technician and reports to Thomas Wells.
 Claire Collins, id 89, is a Supervisor and reports to George Mills.
 Jim Four, id 95, is a Receptionist and reports to Claire Collins.
 Tom Flat, id 104, is a Receptionist who reports to Claire Collins.
 Grace Marks, id 64, is a Manager and reports to Simon Sneath.
 Dan Four, id 68, is a Manager and reports to Simon Sneath.
 Shad Fifty, id 117, is in Security and reports to Dan Four.
 Tall Nephew, id 108, is in Legal and reports to Grace Marks
-Short Nephew, id 109, is in Legal and reports to Grace Marks
+Tall Nephew, id 108, is in Legal and reports to Grace Marks.
 import java.util.HashMap;

@@ Line 1: / Line 1: @@
 ==Java Graph Implementation with Search Methods==
 import java.util.HashMap;
 import java.util.LinkedList;

@@ Line 572: / Line 572: @@
 Suppose we have coin denominations of [1, 2, 5] and the total amount is 7. We can make changes in the following 6 ways:
-public class Arrays {
+public class Combinations {
      static int changeOptions(int[] denominations, int amount) {
          int[] solution = new int[amount + 1];