You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+61
Original file line number
Diff line number
Diff line change
@@ -9,6 +9,67 @@ Algorithms and data structures are fundamental to efficient code and good softwa
9
9
10
10
This repository is contribution friendly :smiley:. If you'd like to add or improve an algorithm, your contribution is welcome! Please be sure to checkout the [Wiki](https://github.com/williamfiset/Algorithms/wiki) for instructions.
11
11
12
+
# Running an algorithm implementation
13
+
14
+
To compile and run any of the algorithms here, you need at least JDK version 8. Gradle can make things more convenient for you, but it is not required.
This project supports the [Gradle Wrapper](https://docs.gradle.org/current/userguide/gradle_wrapper.html). The Gradle wrapper automatically downloads Gradle at the first time it runs, so expect a delay when running the firt command below.
44
+
45
+
If you are on Windows, use `gradlew.bat` instead of `./gradlew` below.
46
+
47
+
48
+
Run a single algorithm like this:
49
+
50
+
```
51
+
./gradlew -q run -Palgorithm=<algorithm-subpackage>.<algorithm-class>
52
+
```
53
+
54
+
55
+
Alternatively, you can run a single algorithm specifying the full class name
56
+
```
57
+
./gradlew -q run -Pmain=<algorithm-fully-qualified-class-name>
58
+
59
+
```
60
+
61
+
For instance:
62
+
63
+
```
64
+
./gradlew run -Palgorithm=search.BinarySearch
65
+
```
66
+
67
+
or
68
+
69
+
```
70
+
./gradlew run -Pmain=com.williamfiset.algorithms.search.BinarySearch
*[Avl Tree (recursive)](https://github.com/williamfiset/algorithms/tree/master/src/main/java/com/williamfiset/algorithms/datastructures/balancedtree/AVLTreeRecursive.java)
0 commit comments