Skip to content

Instantly share code, notes, and snippets.

@artlovan
artlovan / Fibonacci.java
Created April 8, 2017 02:10
Java 8 / Lambda approach to generate fibonacci series.
import java.util.List;
import java.util.stream.Stream;
import static java.util.stream.Collectors.toList;
public class Fibonacci {
/**
* Java 8 / Lambda approach to generate fibonacci series.
* Fibonacci always start as classic (e.g. 0, 1, 1, 2, 3, 5)
* @param series Number of how many fibonacci number should be generated
@artlovan
artlovan / Armstrong.java
Created April 8, 2017 16:19
Java 8 / Lambda approach to generate Armstrong number.
import java.util.List;
import java.util.stream.Stream;
import static java.util.stream.Collectors.toList;
class Armstrong {
/**
* /**
* Java 8 / Lambda approach to generate Armstrong number.
@artlovan
artlovan / PrimeNumber.java
Created April 8, 2017 19:10
Java 8 / Lambda approach to generate Prime number.
import java.util.*;
import java.util.stream.Stream;
import static java.util.stream.Collectors.toList;
public class PrimeNumber {
/**
* Java 8 / Lambda approach to generate Prime number.
@artlovan
artlovan / BubbleSort.java
Created April 12, 2017 22:52
BubbleSort
import java.util.Arrays;
public class BubbleSort {
public static int[] data = new int[]{1, 8, 2, 7, 3, 4, 7, 6};
public static void main(String[] args) {
sort();
System.out.println(Arrays.toString(data));
}
@artlovan
artlovan / Reverse.java
Created April 12, 2017 23:22
Reverse values in an array
import java.util.Arrays;
public class Reverse {
private static int[] data = new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
public static void main(String[] args) {
reverse();
System.out.println(Arrays.toString(data));
}
@artlovan
artlovan / SearchBreadthDepth.java
Created April 12, 2017 23:26
Search by Depth & by Breadth
import java.util.*;
import java.util.stream.Stream;
import static java.util.stream.Collectors.toList;
public class SearchBreadthDepth {
/**
node5
node3 node4
@artlovan
artlovan / QuickSort.java
Last active April 17, 2017 21:15
QuickSort in Java
import java.util.Arrays;
public class QuickSort {
private static int[] data = new int[]{19, 43, 35, 20, 50, 47, 42, 43, 47, 47};
public static void main(String[] args) {
System.out.println(Arrays.toString(data));
sort();
System.out.println(Arrays.toString(data));
@artlovan
artlovan / SelectionSearch.java
Created April 13, 2017 23:45
SelectionSearch in Java
public class SelectionSearch {
private static int[] data = new int[]{9, 1, 43, 5, 20, 50, 7, 22, 43, 17, 47};
public static void main(String[] args) {
System.out.println(Arrays.toString(data));
selectionSort();
System.out.println(Arrays.toString(data));
}
public static void selectionSort() {
@artlovan
artlovan / SelectionSearch.java
Created April 14, 2017 00:04
SelectionSearch in Java
public class SelectionSearch {
private static int[] data = new int[]{9, 1, 43, 5, 20, 50, 7, 22, 43, 17, 47};
public static void main(String[] args) {
System.out.println(Arrays.toString(data));
insertionSort();
System.out.println(Arrays.toString(data));
}
public static void insertionSort() {
@artlovan
artlovan / App.java
Created April 14, 2017 00:10
BellmanFord Algorithm in Java
import java.util.ArrayList;
import java.util.List;
public class App {
public static void main(String[] args) {
List<Vertex> vertexList = new ArrayList<>();
vertexList.add(new Vertex("A"));
vertexList.add(new Vertex("B"));
vertexList.add(new Vertex("C"));