Skip to content

Instantly share code, notes, and snippets.

@jayeshsolanki93
jayeshsolanki93 / InsertionSort.java
Created April 10, 2014 17:22
InsertionSort in Java
import java.util.Arrays;
import java.util.Scanner;
class InsertionSort {
private static Scanner sc;
public static void main(String args[]) {
sc = new Scanner(System.in);
System.out.println("Enter no of terms");
@jayeshsolanki93
jayeshsolanki93 / SelectionSort.java
Created April 10, 2014 17:23
SelectionSort in Java
import java.util.Arrays;
import java.util.Scanner;
class SelectionSort {
private static Scanner sc;
public static void main(String args[]) {
sc = new Scanner(System.in);
System.out.println("Enter no of terms");
@jayeshsolanki93
jayeshsolanki93 / MergeSort.java
Last active August 24, 2021 12:50
MergeSort in Java
import java.util.Arrays;
import java.util.Scanner;
class MergeSort {
private static Scanner sc;
public static void main(String args[]) {
sc = new Scanner(System.in);
System.out.println("Enter no of terms");
@jayeshsolanki93
jayeshsolanki93 / QuickSort.java
Created April 10, 2014 17:25
QuickSort in Java
import java.util.Arrays;
import java.util.Scanner;
class QuickSort {
private static Scanner sc;
public static void main(String args[]) {
sc = new Scanner(System.in);
System.out.println("Enter no of terms");
@jayeshsolanki93
jayeshsolanki93 / HeapSort.java
Created April 10, 2014 17:27
HeapSort in Java
import java.util.Arrays;
import java.util.Scanner;
class HeapSort {
private static Scanner sc;
public static void main(String args[]) {
sc = new Scanner(System.in);
System.out.println("Enter no of terms");
@jayeshsolanki93
jayeshsolanki93 / SinglyLinkedList.java
Created April 10, 2014 17:29
Singly Linked List in Java
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class IntSLLNode {
public int info;
public IntSLLNode next;
public IntSLLNode(int i) {
this(i, null);
@jayeshsolanki93
jayeshsolanki93 / DoublyLinkedList.java
Created April 10, 2014 17:32
Doubly Linked List in Java
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class IntDLLNode {
public int info;
public IntDLLNode next, prev;
public IntDLLNode(int i) {
this(i, null, null);
@jayeshsolanki93
jayeshsolanki93 / BST.java
Created April 10, 2014 17:35
Binary Search Tree in Java
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
class IntBSTNode {
protected int key;
protected IntBSTNode left, right;
public IntBSTNode() {
#include<stdio.h>
#include<stdlib.h>
struct node {
int data;
struct node *next;
}*head;
void addtoHead(int el) {
struct node *temp;
@jayeshsolanki93
jayeshsolanki93 / .eslintrc
Last active August 2, 2016 09:06
Eslint for react
{
"env": {
"browser": true,
"node": true,
"es6": true
},
"globals": {
},
"parserOptions": {
"ecmaFeatures": {