code stringlengths 1 2.01M | repo_name stringlengths 3 62 | path stringlengths 1 267 | language stringclasses 231
values | license stringclasses 13
values | size int64 1 2.01M |
|---|---|---|---|---|---|
package ru.java2e;
import javax.swing.*;
public abstract class MainClass
{
public static void main(String[] args)
{
JFrame window = new JFrame();
window.setSize(640, 640);
window.setTitle("Battle City");
window.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
window.add(new Map());
... | 12pi-algs | trunk/MaximChugunov/Курсовая/BattleCity/src/ru/java2e/MainClass.java | Java | mit | 393 |
package ru.java2e;
import java.awt.Color;
import java.awt.Graphics;
import java.awt.Graphics2D;
import java.awt.Image;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.awt.event.KeyAdapter;
import java.awt.event.KeyEvent;
import javax.swing.ImageIcon;
import javax.swing... | 12pi-algs | trunk/MaximChugunov/Курсовая/BattleCity/src/ru/java2e/Map.java | Java | mit | 15,546 |
import java.io.File;
public class DirectAndSize
{
public DirectAndSize(String path)
{
File root = new File(path);
printDirect(root.getPath(), 0);
}
public long printDirect(String path, int level)
{
long sizeByt = 0;
File tmp = new File(path);
for(int l = 0; l < level; l++)
... | 12pi-algs | trunk/MaximChugunov/AlgTree/src/DirectAndSize.java | Java | mit | 828 |
import java.util.Random;
public class QuickSort {
public static int ARRAY_LENGTH = 30;
private static int[] array = new int[ARRAY_LENGTH];
private static Random generator = new Random();
public static void initArray() {
for (int i=0; i<ARRAY_LENGTH; i++) {
array[i] = ge... | 12pi-algs | trunk/MaximChugunov/alg02/src/QuickSort.java | Java | mit | 1,829 |
import java.util.ArrayList;
import java.util.Collections;
public class bubleSort {
public static void main(String[] args) {
// int[] a = new int [100];
int num = 100000;
ArrayList<Integer> list = new ArrayList<Integer>(100000);
for (int i=0;i<100000;i++) {
list.add(i);
}
Collections.shuff... | 12pi-algs | trunk/MaximChugunov/alg02/src/bubleSort.java | Java | mit | 933 |
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class Binar_search
{
public static void main(String[] args)
{
int num = 10;
ArrayList<Integer> list = new ArrayList<Integer>(num);
for(int i = 0; i < num; i++)
list.add(i);
Collection... | 12pi-algs | trunk/MaximChugunov/Binary_search/src/Binar_search.java | Java | mit | 1,171 |
public class Heap
{
public int array[];
public int length;
public void swap(int i, int j)
{
int tmp = array[i];
array[i]=array[j];
array[j]=tmp;
}
public void buildHeap()
{
while(length != 0)
{
for(int i = (length - 1)/2; i >= 0; i--)
maxHeap(i);
swap(0,length-1);
... | 12pi-algs | trunk/MaximChugunov/Heap_sort/src/Heap.java | Java | mit | 1,315 |
import java.math.BigInteger;
import java.util.Random;
public class Karatsuba {
public static BigInteger karacuba(BigInteger x, BigInteger y)
{
int N = Math.max(x.bitLength(), y.bitLength());
if (N <= 2000) return x.multiply(y);
N = (N / 2) + (N % 2);
BigInteger b = x.shiftRight(N);
B... | 12pi-algs | trunk/MaximChugunov/Sum&Multiply/src/Karatsuba.java | Java | mit | 1,258 |
package Calendar;
import java.util.Scanner;
public class day {
public int D = 1,M = 1,Y = 1,Number_of_Mouth = 1,
DoM[] = {0,31,28,31,30,31,30,31,31,30,31,30,31},
DoW = 0,Number_of_day = 0;
public int Search(week day){
if(day.M == M && day.Y == Y)return (day.D-D+DoW)%7;
if(day.Y == Y && d... | 12pi-algs | trunk/IvanShlyapkin/Happy_Birthday/src/Calendar/day.java | Java | mit | 1,160 |
package Calendar;
public class week {
public int D;
public int M;
public int Y;
public week(int Day, int Mounth, int Year){
this.D = Day;
this.M = Mounth;
this.Y = Year;
}
}
| 12pi-algs | trunk/IvanShlyapkin/Happy_Birthday/src/Calendar/week.java | Java | mit | 221 |
package binary;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class bynarySearch {
@SuppressWarnings("resource")
public static void main(String[] args) {
int num=10;
ArrayList<Integer> list = new ArrayList<Integer>(num);
for(int i=0;i<num;i++){
... | 12pi-algs | trunk/IvanShlyapkin/binary/src/binary/bynarySearch.java | Java | mit | 1,096 |
package root;
public class call_funtion {
public static void main(String[] args)
{
Three tree = new Three();
int num = 5;
for(int k = 0; k < num; k++)
{
int number = (int) (Math.random()*num*2-num);
System.out.print(number + ",");
tree.add(number);
}
tree.printTree();
Sys... | 12pi-algs | trunk/IvanShlyapkin/BinaryTree/src/root/call_funtion.java | Java | mit | 861 |
package root;
public class Three {
public class EL
{
int num;
EL left;
EL right;
EL iam;
EL parent;
public EL(int num, EL parent)
{
this.num = num;
this.left = null;
this.right = null;
this.iam = this;
this.parent = parent;
}
}
EL root;
int lenght;
pu... | 12pi-algs | trunk/IvanShlyapkin/BinaryTree/src/root/Three.java | Java | mit | 3,707 |
package root;
public class EL {
int num;
EL left;
EL right;
EL iam;
EL parent;
public EL(int num, EL parent)
{
this.num = num;
this.left = null;
this.right = null;
this.iam = this;
this.parent = parent;
}
}
| 12pi-algs | trunk/IvanShlyapkin/BinaryTree/src/root/EL.java | Java | mit | 246 |
package algoritm;
import java.util.ArrayList;
import java.util.Collections;
public class sort {
public static void main(String[] args) {
int num=10;
ArrayList<Integer> list = new ArrayList<Integer>(num);
for(int i=0;i<num;i++){
list.add(i);
}
Collections.shuffle(list);
System.out.prin... | 12pi-algs | trunk/IvanShlyapkin/buble/src/algoritm/sort.java | Java | mit | 926 |
package sort;
public class Heap
{
int arr[];
public Heap()
{
arr = new int[11];
}
private int getL(int i)
{
if(0 < 2*i && 2*i < arr.length)
return arr[2*i];
return 0;
}
private int getR(int i)
{
if(0 < 2*i+1 && 2*i+1 < arr.length)
return arr[2*i+1];
return 0;
}
... | 12pi-algs | trunk/IvanShlyapkin/Tree_Sort/src/sort/Heap.java | Java | mit | 1,908 |
package algoritm;
public class cl {
public static void main(String[] args) {
int a=12345, b= 125;
long start = System.nanoTime();
evklid(a,b);
perebor(a,b);
svou(a,b);
long end = System.nanoTime();
long traceTime = end-start;
System.out.println(traceTime);
}
public static void evklid(... | 12pi-algs | trunk/IvanShlyapkin/evklid/src/algoritm/cl.java | Java | mit | 912 |
public class Testing {
public static void main(String[] args) {
Map q = new Map();
q.printMap();
q.Add(new El("Name","Tom"));
q.Add(new El("surname","Johnson"));
System.out.println(q);
q.Add(new El("Name","John"));
q.Add(new El("Market_of_economic","7"));
q.Add(new El("Market_of_progra... | 12pi-algs | trunk/IvanShlyapkin/Hash_map/src/Testing.java | Java | mit | 1,033 |
public class Map
{
public El head = null;
public void printMap()
{
if(head == null)System.out.println("Error: Map is empty!");
else
{
El cur = head;
System.out.print("Key list: ");
while(cur.next!=null)
{
System.out.print(cur.key+" ");
cur = cur.next;
}
System.out... | 12pi-algs | trunk/IvanShlyapkin/Hash_map/src/Map.java | Java | mit | 3,418 |
public class El
{
public El next;
public String key;
public String value;
public El(String key, String value)
{
this.key = key;
this.value = value;
}
}
| 12pi-algs | trunk/IvanShlyapkin/Hash_map/src/El.java | Java | mit | 179 |
package factorial;
public class fact {
public static void main(String[] args) {
int a=7;
factor(a);
System.out.print(factor(a));
}
public static int factor(int a) {
if (a<=1)
return 1;
else
return factor(a-1)*a;
}
}
| 12pi-algs | trunk/IvanShlyapkin/factorial/src/factorial/fact.java | Java | mit | 259 |
package quick;
import java.util.Random;
public class qiuck {
public static void main(String[] args) {
int num=1000000;
int[] arr = new int[num];
Random rand = new Random();
for(int i=0;i<num;i++){
arr[i]=rand.nextInt(num);
}
PrintArr(arr,num);
long start = System.nanoTime();
QuickSo... | 12pi-algs | trunk/IvanShlyapkin/quick/src/quick/qiuck.java | Java | mit | 1,001 |
import java.util.ArrayList;
import java.util.Collections;
public class bublesort {
public static void main(String[] args) {
int num = 10;
ArrayList<Integer> list = new ArrayList<Integer>(10);
for (int i=0;i<10;i++) {
list.add(i);
}
Collections.shuffle(list);
System.out.println(... | 12pi-algs | trunk/KirillBaburin/bublesort/src/bublesort.java | Java | mit | 918 |
package algorithms;
public class Tree {
public Element head = null;
public Element min(){
Element current = head;
while(current.left!=null){
current = current.left;
}
return current;
}
public Element max(){
Element current = head;
while(current.right!=null){
current = current.... | 12pi-algs | trunk/KirillBaburin/BinaryTree/src/algorithms/Tree.java | Java | mit | 827 |
package algorithms;
public class Element {
public Element right;
public Element left;
public int key;
public String value;
Element(int Key, String Value){
value = Value;
key = Key;
}
}
| 12pi-algs | trunk/KirillBaburin/BinaryTree/src/algorithms/Element.java | Java | mit | 213 |
import java.util.Random;
public class QuickSort {
public static int ARRAY_LENGTH = 1000000;
private static int[] array = new int[ARRAY_LENGTH];
private static Random generator = new Random();
public static void initArray() {
for (int i=0; i<ARRAY_LENGTH; i++) {
array[i] = ge... | 12pi-algs | trunk/KirillBaburin/sortirovki/src/QuickSort.java | Java | mit | 1,803 |
public class factorial {
public static int fac (int n)
{
if (n <= 1)
return 1;
return n * fac(n-1);
}
public static void main(String[] args) {
System.out.println (fac(4));
}
}
| 12pi-algs | trunk/KirillBaburin/factorial/src/factorial.java | Java | mit | 202 |
public class algoritm4 {
static int count=0;
public static int fib1 (int n)
{
if (n == 0)
return 0;
if (n == 1)
return 1;
count++;
return fib1(n-2) + fib1(n-1);
}
public static void main(String[] args) {
System.out.println (fib1(10));
System.out.println(count);
}
} | 12pi-algs | trunk/KirillBaburin/fibonahi/src/algoritm4.java | Java | mit | 307 |
package Algo;
import java.io.File;
public class Node
{
File file;
Node father = null;
Node son = null;
Node brother = null;
public Node (File name)
{
this.file = name;
}
}
| 12pi-algs | trunk/EvgeniyKolchin/Tree/Node.java | Java | mit | 203 |
package Algo;
import java.io.File;
public class Tree
{
private static Node make_tree (File dir)
{
Node root = new Node (dir);
if (dir.isDirectory())
{
make_tree_iter (root);
return root;
}
else
{
return root;
}
}
private static void make_tree_iter (Node c... | 12pi-algs | trunk/EvgeniyKolchin/Tree/Tree.java | Java | mit | 1,645 |
package bin_search;
public class search {
public int bin_search (int array[], int n, int x)
{
int first = 0;
int last = n;
int mid = (last - first) / 2;
if (last == 0)
{
return 0;
}
else if (array[0] > x)
{
return 0;
}
else if (array[n-1] < x)
{
return 0;
}
whi... | 12pi-algs | trunk/EvgeniyKolchin/binsearch/search.java | Java | mit | 651 |
package bin_search;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Random;
public class main {
public static void main(String[] args) {
search w = new search();
long time_start = 0;
int max = 15;
int x =7;
int[] array = new in... | 12pi-algs | trunk/EvgeniyKolchin/binsearch/main.java | Java | mit | 978 |
package bintree;
public class methods {
Node root = null;
int depth = 0;
Node addNode(int value) {
Node node = root;
if(root == null) {
root = new Node(value, null);
return root;
}
while(node != null)
if(value <= node.value) {
if(node.left == null) {
... | 12pi-algs | trunk/MikhailSamoylov/bintree/src/bintree/methods.java | Java | mit | 1,180 |
package algorithms;
import javax.swing.*;
import java.awt.*;
import java.awt.event.*;
public class TicTacToeGUI extends JFrame {
/**
*
*/
private static final long serialVersionUID = 1L;
private static final String TITLE = "Tic Tac Toe";
private static final int WIDTH = 450;
private static fina... | 12pi-algs | trunk/VladimirIvanov/TicTacToeGUI/src/algorithms/TicTacToeGUI.java | Java | mit | 4,816 |
package binaryTree;
import java.util.Scanner;
public class BinaryTree
{
public class Node
{
int num;
Node left;
Node right;
Node iam;
Node parent;
public Node(int num, Node parent)
{
this.num = num;
this.left = null;
this.right = null;
this.iam = this;
this.parent... | 12pi-algs | trunk/AndreyAndrianov/binarytree/BinaryTree.java | Java | mit | 4,926 |
package fib;
public class fib
{
public static void main(String[] args)
{
long start;
start = System.nanoTime();
System.out.println(fib(7));
System.out.println("Time of running: "+(System.nanoTime()-start)+" nanosec");
start = System.nanoTime();
System.out.println(fib_rec(10... | 12pi-algs | trunk/AndreyAndrianov/fib/fib.java | Java | mit | 814 |
package searchTests;
import java.util.ArrayList;
public interface ISearch {
public int search(ArrayList<Integer> array, int elem);
}
| 12pi-algs | trunk/NikitaPutikhin/searchTests/src/searchTests/ISearch.java | Java | mit | 143 |
package searchTests;
import java.util.ArrayList;
import java.util.Random;
import sortTests.QuickSort;
public class SearchTestsMain {
public static void main(String[] args) {
int size = 10000;
int tries = 200;
for (int a = 0; a < tries; a++) {
if (tries > 10) if (a % (tries / 10) == 0) System.... | 12pi-algs | trunk/NikitaPutikhin/searchTests/src/searchTests/SearchTestsMain.java | Java | mit | 1,184 |
package searchTests;
import java.util.ArrayList;
public class BinSearch implements ISearch {
@Override
public int search(ArrayList<Integer> array, int elem) {
return searchInner(array, elem, 0, array.size()-1);
}
private int searchInner(ArrayList<Integer> array, int elem, int l, int r) {
if (r ... | 12pi-algs | trunk/NikitaPutikhin/searchTests/src/searchTests/BinSearch.java | Java | mit | 665 |
package guiTicTacToe;
import javax.swing.*;
import java.awt.*;
import java.awt.event.*;
import botTicTacToe.*;
public class TicTacToeGUI extends JFrame {
/**
*
*/
private static final long serialVersionUID = 1L;
private static final String TITLE = "Tic Tac Toe";
private static final int WIDT... | 12pi-algs | trunk/NikitaPutikhin/botTicTacToe/src/guiTicTacToe/TicTacToeGUI.java | Java | mit | 5,251 |
package botTicTacToe;
import java.util.ArrayList;
public class MainBotTicTacToe {
public static void main(String[] args) {
/*try {
char[][] fieldChar = new char[3][3];
byte[][] fieldByte = new byte[3][3];
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String ... | 12pi-algs | trunk/NikitaPutikhin/botTicTacToe/src/botTicTacToe/MainBotTicTacToe.java | Java | mit | 1,444 |
package botTicTacToe;
public class GameBot {
private GameTree game;
private int side;
int nextTurn;
public GameBot(int side) {
this.side = side;
game = null;
}
public void init(int nextTurn) {
if (inited()) return;
game = new GameTree();
game.generateMap(nextTurn);
this.nextTurn =... | 12pi-algs | trunk/NikitaPutikhin/botTicTacToe/src/botTicTacToe/GameBot.java | Java | mit | 2,817 |
package botTicTacToe;
/**
* This class stores information about state of the game
*/
public class GameField implements Cloneable {
public static final int MARK_NONE = 0;
public static final int MARK_X = 1;
public static final int MARK_O = 2;
public static final int WINNER_NONE = 0;
public static fi... | 12pi-algs | trunk/NikitaPutikhin/botTicTacToe/src/botTicTacToe/GameField.java | Java | mit | 11,013 |
package botTicTacToe;
import java.util.HashMap;
/** Not actually a tree, but provides tree-like interface
*
* @author NP
*
*/
public class GameTree {
private GameField currentField;
private HashMap<GameField, GameNode> nodeMap;
public GameTree() {
currentField = new GameField();
nodeMap =... | 12pi-algs | trunk/NikitaPutikhin/botTicTacToe/src/botTicTacToe/GameTree.java | Java | mit | 2,654 |
package myHashMap;
public class MyHashMapMain {
public static void main(String[] args) {
System.out.println("Collision testing:");
MyHashMap<String, String> mapStrings = new MyHashMap<String, String>();
String one = "aaaba";
System.out.println("\"" + one + "\" hash: " + one.hashCode());
String two... | 12pi-algs | trunk/NikitaPutikhin/myHashMap/src/myHashMap/MyHashMapMain.java | Java | mit | 1,387 |
package myHashMap;
import java.util.ArrayList;
import java.util.List;
public class MyHashMap<K, V> {
private static final float DEFAULT_LOAD_FACTOR = 0.75f;
private static final int DEFAULT_CAPACITY = 128;
private static final int MAX_CAPACITY = Integer.MAX_VALUE;
public MyHashMap(int capacity, flo... | 12pi-algs | trunk/NikitaPutikhin/myHashMap/src/myHashMap/MyHashMap.java | Java | mit | 4,070 |
package stack;
public class StackMain {
public static void main(String[] args) {
Stack<Integer> stack = new Stack<Integer>();
stack.push(1);
stack.push(2);
stack.push(3);
System.out.println(stack.pop());
System.out.println(stack.pop());
System.out.println(stack.pop());
}
}
| 12pi-algs | trunk/NikitaPutikhin/stack/src/stack/StackMain.java | Java | mit | 316 |
package stack;
import java.util.ArrayList;
public class Stack<T> {
private ArrayList<T> arr;
int stackPtr;
Stack() {
arr = new ArrayList<T>();
stackPtr = -1;
}
void push(T elem) {
stackPtr++;
if (arr.size() <= stackPtr) {
arr.add(elem);
} else {
arr.set(stackPtr, elem);
}... | 12pi-algs | trunk/NikitaPutikhin/stack/src/stack/Stack.java | Java | mit | 410 |
package fibTests;
import java.util.ArrayList;
public class FibRecDynamic implements IFib {
private int iterations;
public FibRecDynamic() {
results = new ArrayList<Long>();
iterations = 0;
}
@Override
public int getLastIterationsCounter() {
return iterations;
}
private ArrayList<Lon... | 12pi-algs | trunk/NikitaPutikhin/fibTests/src/fibTests/FibRecDynamic.java | Java | mit | 819 |
package fibTests;
public class FibCycle implements IFib {
private int iterations;
public FibCycle() {
iterations = 0;
}
@Override
public int getLastIterationsCounter() {
return iterations;
}
@Override
public long fib(int n) {
if (n <= 0) return 0;
long current = 1;
long previou... | 12pi-algs | trunk/NikitaPutikhin/fibTests/src/fibTests/FibCycle.java | Java | mit | 506 |
package fibTests;
public class FibRecNaive implements IFib {
private int iterations;
public FibRecNaive() {
iterations = 0;
}
@Override
public int getLastIterationsCounter() {
return iterations;
}
@Override
public long fib(int n) {
if (n <= 0) return 0;
iterations = 1;
if (n <=... | 12pi-algs | trunk/NikitaPutikhin/fibTests/src/fibTests/FibRecNaive.java | Java | mit | 504 |
package fibTests;
public interface IFib {
public int getLastIterationsCounter();
public long fib(int n);
}
| 12pi-algs | trunk/NikitaPutikhin/fibTests/src/fibTests/IFib.java | Java | mit | 116 |
package fibTests;
public class Main {
public static void main(String[] args) {
System.out.println("n rec cycle dynamic matrix");
for (int n = 10; n <= 40; n++) {
System.out.print(n+" ");
IFib fib = new FibRecNaive();
fib.fib(n);
int iter = fib.getLastIterationsCounter();
System.out.p... | 12pi-algs | trunk/NikitaPutikhin/fibTests/src/fibTests/Main.java | Java | mit | 721 |
package fibTests;
public class FibMatrix implements IFib {
private int iterations;
public FibMatrix() {
iterations = 0;
}
@Override
public int getLastIterationsCounter() {
return iterations;
}
@Override
//Taken from
//ru.wikibooks.org
public long fib(int n)
{
iterations = 0;
... | 12pi-algs | trunk/NikitaPutikhin/fibTests/src/fibTests/FibMatrix.java | Java | mit | 685 |
package sortTests;
import java.util.List;
public class BubbleSortNaive implements ISorter {
@Override
public void sort(List<Integer> array) {
for (int i = 0; i < array.size(); i++) {
for (int j = i; j < array.size(); j++) {
if (array.get(i) > array.get(j)) {
int t = array.get(j);
ar... | 12pi-algs | trunk/NikitaPutikhin/sortTests/src/sortTests/BubbleSortNaive.java | Java | mit | 395 |
package sortTests;
import java.util.List;
import java.util.Random;
public class QuickSort implements ISorter {
@Override
public void sort(List<Integer> array) {
if (array.size() <= 1) return;
Random random = new Random();
int pivotIndex = random.nextInt(array.size()-1);
int pivot = array.get(pi... | 12pi-algs | trunk/NikitaPutikhin/sortTests/src/sortTests/QuickSort.java | Java | mit | 739 |
package sortTests;
import java.util.List;
public class HeapSort implements ISorter {
@Override
public void sort(List<Integer> array) {
if (array.size() <= 1) return;
buildHeap(array);
for (int i = 1; i < array.size(); i++) {
int last = array.size()-i;
int t = array.get(0);
... | 12pi-algs | trunk/NikitaPutikhin/sortTests/src/sortTests/HeapSort.java | Java | mit | 1,101 |
package sortTests;
import java.util.List;
public interface ISorter {
public void sort(List<Integer> array);
}
| 12pi-algs | trunk/NikitaPutikhin/sortTests/src/sortTests/ISorter.java | Java | mit | 120 |
package sortTests;
import java.util.List;
public class BubbleSort implements ISorter {
@Override
public void sort(List<Integer> array) {
for (int i = 0; i < array.size()-1; i++) {
boolean swapMade = false;
for (int j = i; j < array.size(); j++) {
if (array.get(i) > array.get(j)) {
int ... | 12pi-algs | trunk/NikitaPutikhin/sortTests/src/sortTests/BubbleSort.java | Java | mit | 473 |
package sortTests;
import java.util.ArrayList;
import java.util.List;
public class MergeSort implements ISorter {
@Override
public void sort(List<Integer> array) {
if (array.size() <= 1) return;
sort(array.subList(0, array.size()/2));
sort(array.subList(array.size()/2, array.size()));
ArrayList... | 12pi-algs | trunk/NikitaPutikhin/sortTests/src/sortTests/MergeSort.java | Java | mit | 867 |
package sortTests;
import java.util.ArrayList;
import java.util.Collections;
public class MainSortTests {
public static void main(String[] args) {
/*BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter array:");
String arrayString = br.readLine();
Sc... | 12pi-algs | trunk/NikitaPutikhin/sortTests/src/sortTests/MainSortTests.java | Java | mit | 1,488 |
package dataTypeTests;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Random;
public class ArrayListTester<T extends Comparable<? super T>> implements DataTypeTester<T> {
ArrayList<T> array;
ArrayListTester(List<T> list) {
array = new ArrayList<T>(li... | 12pi-algs | trunk/NikitaPutikhin/dataTypeTests/src/dataTypeTests/ArrayListTester.java | Java | mit | 1,378 |
package dataTypeTests;
import java.util.Collections;
import java.util.List;
import java.util.Random;
public class OneWayListTester<T extends Comparable<? super T>> implements DataTypeTester<T> {
List<T> list;
OneWayListTester(List<T> list) {
this.list = list;
}
@Override
public long measureB... | 12pi-algs | trunk/NikitaPutikhin/dataTypeTests/src/dataTypeTests/OneWayListTester.java | Java | mit | 1,426 |
package dataTypeTests;
import java.util.Collection;
import java.util.Iterator;
public class OneWayList<T>{
private T data;
private OneWayList<T> next;
OneWayList(T data) {
this.data = data;
next = null;
}
OneWayList(T[] data) {
this.data = data[0];
next = null;
OneWayList<T> last =... | 12pi-algs | trunk/NikitaPutikhin/dataTypeTests/src/dataTypeTests/OneWayList.java | Java | mit | 2,902 |
package dataTypeTests;
public interface DataTypeTester<T> {
public long measureBinSearch(int iterations);
public long measureBubbleSort(int iterations);
}
| 12pi-algs | trunk/NikitaPutikhin/dataTypeTests/src/dataTypeTests/DataTypeTester.java | Java | mit | 164 |
package dataTypeTests;
import java.util.ArrayList;
import java.util.Random;
public class DataTypeTestMain {
public static void main(String[] args) {
ArrayList<Integer> arr = new ArrayList<Integer>();
int size = 100;
Random random = new Random();
for (int i = 0; i < size; i++) {
arr.add(random... | 12pi-algs | trunk/NikitaPutikhin/dataTypeTests/src/dataTypeTests/DataTypeTestMain.java | Java | mit | 597 |
package gcd;
import java.util.Random;
public class Main {
public static void main(String[] args) {
long bruteTimeAvg = 0;
long bruteTimeMax = 0;
long euclidianTimeAvg = 0;
long euclidianTimeMax = 0;
int tries = 100000;
int maxN = 10000000;
Random random = new Random();
System.o... | 12pi-algs | trunk/NikitaPutikhin/gcd/src/gcd/Main.java | Java | mit | 1,827 |
package gcd;
/**
* Finds Greatest Common Divisor using Euclidian algorithm
* @author NP
*
*/
public class EuclidianGCD {
public static int find(int a, int b) {
if ((a == 0)||(b == 0)) return -1;
int t;
if (a < b) {
t = b;
b = a;
a = t;
}
while (b != 0) {
t = a % b;
a =... | 12pi-algs | trunk/NikitaPutikhin/gcd/src/gcd/EuclidianGCD.java | Java | mit | 363 |
package gcd;
/**
* Finds Greatest Common Divisor using brute force search
* @author NP
*
*/
public class BruteGCD {
public static int find(int a, int b) {
if ((a == 0)||(b == 0)) return -1;
if (a == b) return a;
if (a < b) {
int t = b;
b = a;
a = t;
}
if (a % b == 0) return b;... | 12pi-algs | trunk/NikitaPutikhin/gcd/src/gcd/BruteGCD.java | Java | mit | 429 |
package evklid;
public class HeapSort
{
private int[] arr;
private int length;
public void buildHeap()
{ while(length!=0)
{
for(int i = (length - 1)/2; i>=0; i--)
{
maxHeap(i);
}
exchange(0,length-1);
length--;
}
}
private void maxHeap(int parent)
{
int left... | 12pi-algs | trunk/ElizavetaBaydakova/HeapSort.java | Java | mit | 1,347 |
package evklid;
import java.util.Scanner;
public class hod
{ static int n=5;
static int count=1;
static int [][]arr=new int [n][n];
static int []dx={2,1,-1,-2,-2,-1,1,2};
static int []dy={1,2,2,1,-1,-2,-2,-1};
public static void main(String[] args)
{
for (int i=0; i<n; i++)
{
... | 12pi-algs | trunk/ElizavetaBaydakova/hod.java | Java | mit | 1,992 |
package evklid;
import java.math.*;
public class summa {
public static void main(String[] args) {
int c;
long a=(long)(Math.random()*1000000000*1000000000);
long b=(long)(Math.random()*1000000000*1000000000);
System.out.println(" " +a);
System.out.println("+");
System.out.println... | 12pi-algs | trunk/ElizavetaBaydakova/summa.java | Java | mit | 757 |
public class Fibzclass
{
public static int fibo(int N)
{
int i=1;
int j=1;
int p=0;
if (N==1||N==2)
{
return 1;
}
else
{
for(int k=3; k<=N; k++)
{
p=i+j;
i=j;
j=p;
}
return(p);
}
}
public static void main(String[] args)
{
long start = Syste... | 12pi-algs | trunk/PolinaDudnova/Fibzikl/src/Fibzclass.java | Java | mit | 476 |
public class NODsvclass
{
public static int svoy(int a,int b)
{
int k=0;
if(a>=b)
{
k=b;
}
else
{
k=a;
}
if(a%2==0 && b%2==0)
{
while(a%k!=0 || b%k!=0)
{
k=k-2;
}
}
else
{
if(a%5==0 && b%5==0)
{
while(a%k!=0 || b%k!=0)
{
... | 12pi-algs | trunk/PolinaDudnova/NODsvoy/src/NODsvclass.java | Java | mit | 708 |
public class Fakclass
{
public static int faktorial(int N)
{
if(N<=1)
return 1;
else
return N*faktorial(N-1);
}
public static void main(String[] args)
{
long start = System.nanoTime();
System.out.println(faktorial(4));
long end = System.nanoTime();
long traceTime = end-start;
S... | 12pi-algs | trunk/PolinaDudnova/Faktorial/src/Fakclass.java | Java | mit | 364 |
public class NODclass
{
public static void main(String[] args)
{
int j=30456;
int i=2350;
long start = System.nanoTime();
for (int k=i; k>0;k--)
{
if ((j%k==0)&&(i%k==0))
{
System.out.println(k);
break;
}
}
long end = System.nanoTime();
long traceTime = ... | 12pi-algs | trunk/PolinaDudnova/NOD/src/NODclass.java | Java | mit | 376 |
package woman;
public class Tree
{
public class Element
{
int num;
Element left_child;
Element right_child;
Element iam;
Element parent;
public Element(int num, Element parent)
{
this.num = num;
this.left_child = null;
this.right_child = null;
this.iam = this;
this.p... | 12pi-algs | trunk/PolinaDudnova/B3/Bad_day/src/woman/Tree.java | Java | mit | 5,641 |
package woman;
public class Tree
{
public class Element
{
int num;
Element left_child;
Element right_child;
Element iam;
Element parent;
public Element(int num, Element parent)
{
this.num = num;
this.left_child = null;
this.right_child = null;
this.iam = this;
this.p... | 12pi-algs | trunk/PolinaDudnova/B3/src/woman/Tree.java | Java | mit | 5,641 |
public class Evkclass
{
public static void Evklid(int a,int b)
{
while (a!=0 && b!=0) {
if (a>b)
a=a%b;
else
b=b%a;
}
System.out.println(a+b);
}
public static void main(String[] args)
{
int j=30456;
int i=2350;
long start = System.nanoTime();
Evklid(j,i);
long end = Syst... | 12pi-algs | trunk/PolinaDudnova/Evklid/src/Evkclass.java | Java | mit | 412 |
package quick;
import java.util.Random;
public class Qclass
{
public static void QuickSort(int arr[], int p, int r)
{
int k;
int j;
int x;
k=p;
j=r;
x=arr[(k+j)/2];
do
{
while(arr[k]<x) k++;
while(arr[j]>x) j--;
if (k<=j)
{
int tmp=arr[k];
arr[k]=arr[j];
arr[j]=t... | 12pi-algs | trunk/PolinaDudnova/quick/src/quick/Qclass.java | Java | mit | 959 |
import java.util.ArrayList;
import java.util.Collections;
public class binaryclass
{
public static void main(String[] args)
{
int num=10;
ArrayList<Integer> list = new ArrayList<Integer>(num);
for(int i=0;i<num;i++)
{
list.add(i);
}
Collections.shuffle(list);
System.out.println(lis... | 12pi-algs | trunk/PolinaDudnova/Binary/src/binaryclass.java | Java | mit | 1,021 |
package bubble;
import java.util.ArrayList;
import java.util.Collections;
public class bubclass
{
public static void main(String[] args)
{
int num=5;
ArrayList<Integer> list= new ArrayList<Integer>(num);
for (int i=0; i<num; i++)
{
list.add(i);
}
Collections.shuffle(list);
System.out... | 12pi-algs | trunk/PolinaDudnova/bubble/src/bubble/bubclass.java | Java | mit | 882 |
public class Fibclass
{
public static int fibo_naive(int N)
{
if(N<=2)
{
return 1;
}
return fibo_naive(N-2)+fibo_naive(N-1);
}
public static void main(String[] args)
{
long start = System.nanoTime();
System.out.println(fibo_naive(6));
long end = System.nanoTime();
long traceT... | 12pi-algs | trunk/PolinaDudnova/Fibanachi/src/Fibclass.java | Java | mit | 381 |
package stolbik;
public class slojenie {
public static int[] arr1;
public static int[] arr2;
public static int[] arr3;
public static int length=5;
public static int n=0;
public static void create(){
/*for(int i=0;i<length;i++){
arr1[i]=0;
arr2[i]=0;
arr3[i]=0;
}*/
//random
for(i... | 12pi-algs | trunk/AndreyGalochkin/stolbik/src/stolbik/slojenie.java | Java | mit | 1,181 |
package lesson4;
public class gkl {
public static void main(String[] args) {
int N=8;
int A[][];
A = new int[N][N];
for( int i=0;i<N;i++){
for( int j=0;j<N;j++){
A[i][j]=0;
}
}
A[2][2]=1;
pr(A);
mir(A,2,2);
pr(A);
}
... | 12pi-algs | trunk/AndreyGalochkin/HodKonem/src/lesson4/gkl.java | Java | mit | 1,575 |
package tree;
public class bin
{
public class Elem
{
int num;
Elem left;
Elem right;
public Elem parent;
public Elem(int num, Elem parent)
{
this.num = num;
this.left = null;
this.right = null;
this.parent = parent;
}
}
Elem root;
int lenght;
/*public bin()... | 12pi-algs | trunk/AndreyGalochkin/BinnaryTree/src/tree/bin.java | Java | mit | 1,810 |
package lesson2;
//import java.util.Scanner;
public class pereborom {
public static void main(String args[])
{
long startTime = System.currentTimeMillis();
int fi = 30;
int si = 1000;
System.out.println(NOD(fi,si));
long timeSpent = System.currentTimeMi... | 12pi-algs | trunk/AndreyGalochkin/NOD/src/lesson2/pereborom.java | Java | mit | 808 |
package Lesson3;
public class Binnary {
public static int bin(int A[],int b, int find)
{
int l=0;
int r=A.length - 1;
while (l <= r) {
int s= l+(r-l)/2;
if(A[s] > find)
r = s-1;
else {
if (find > A[s])
l = s+1;
else
return s;
}
}
return -1;
}
}
| 12pi-algs | trunk/AndreyGalochkin/BinnarySearch/src/Lesson3/Binnary.java | Java | mit | 309 |
package Krestik;
import javax.swing.*;
import java.awt.*;
import java.awt.event.*;
public class TicTacToeGUI extends JFrame {
/**
*
*/
private static final long serialVersionUID = 1L;
private static final String TITLE = "Tic Tac Toe";
private static final int WIDTH = 450;
private static final i... | 12pi-algs | trunk/AndreyGalochkin/Krestik/src/Krestik/TicTacToeGUI.java | Java | mit | 4,813 |
package fgd;
public class SpisokTest {
public static void main(String[] args)
{
Spisok s= new Spisok();
Spisok sp= new Spisok();
int []mas = new int[10];
for( int i=0; i<mas.length;i++)
{
mas[i] = (int)Math.round(Math.random()*(-10));
s.add(new Element(mas[i]));
s.add_end(new E... | 12pi-algs | trunk/AndreyGalochkin/Spiski/src/fgd/SpisokTest.java | Java | mit | 676 |
package fgd;
public class Spisok {
Element head = null;
public void add(Element elem){
if(head == null)
{
head = elem;
}
else{
Element current = head;
while (current.next != null)
{
current = current.next;
}
current.next = elem;
}
}
public void add_begin(E... | 12pi-algs | trunk/AndreyGalochkin/Spiski/src/fgd/Spisok.java | Java | mit | 1,590 |
package fgd;
public class Element
{
public int i;
public Element next = null;
public Element(int i){
this.i=i;
}
}
| 12pi-algs | trunk/AndreyGalochkin/Spiski/src/fgd/Element.java | Java | mit | 139 |
package Stack;
public class spisok {
public element head = null;
public void push(element elem){
if(head == null){
head = elem;
}
else{
elem.next = head;
head = elem;
}
}
public void pop()
{
if (head!=null)
{
Sy... | 12pi-algs | trunk/AntonPozdeev/13.stack/spisok.java | Java | mit | 683 |
package binaryTree;
public class Node
{
public Node left;
public Node right;
public Node parent;
public int key;
public char value;
Node(int K, char V)
{
key=K;
value=V;
}
}
| 12pi-algs | trunk/AntonPozdeev/15.BinaryTree/Node.java | Java | mit | 209 |
package map;
public class spisok {
public element head = null;
public void add_end(element elem){
if(head == null){
head = elem;
}
else {
element cur = head;
while(cur.next != null){
cur = cur.next;
}
cur.next = elem;
}
}
public String toString(){
St... | 12pi-algs | trunk/AntonPozdeev/12.map/spisok.java | Java | mit | 624 |
import java.util.*;
public class Heapsort {
// private int[] arr;
// private int length;
//
//public void buildHeap()
// { while(length!=0)
// {
// for(int i = (length - 1)/2; i>=0; i--)
// {
// maxHeap(i);
// }
// exchange(0,length-1);
// length--;
// }
// }
// private void max... | 12pi-algs | trunk/AntonPozdeev/14.Heap/Heapsort.java | Java | mit | 2,899 |
public class quicksort {
//public static void swap(int a,int b){
//int tmp= a;
//a = b;
//b = tmp;
//}
public static void QuickSort(int A[], int p,int r){
int i; int j; int x;
i=p;
j=r;
x=A[(i+j)/2];
do
{
while(A[i]<x) i++;
while(A[j]>x) j--;
if(i<=j)
{
int tmp... | 12pi-algs | trunk/AntonPozdeev/6.quick_sort/quicksort.java | Java | mit | 1,192 |
public class spisok {
public element head = null;
public void del_beg(element elem){
if(head == null){
head = elem;
}
else {
head=null;
elem=null;
}
}
public void del_end(element elem){
if(head == null){
head = elem;
}
else {
element cur = hea... | 12pi-algs | trunk/AntonPozdeev/9.списки/spisok.java | Java | mit | 1,822 |
import java.util.*;
public class Heapsort {
// private int[] arr;
// private int length;
//
//public void buildHeap()
// { while(length!=0)
// {
// for(int i = (length - 1)/2; i>=0; i--)
// {
// maxHeap(i);
// }
// exchange(0,length-1);
// length--;
// }
// }
// private void max... | 12pi-algs | trunk/AntonPozdeev/14.HeapSort/Heapsort.java | Java | mit | 2,899 |
package dvysvyzny_List;
public class spisok {
public element head = new element();
public void add_end(element elem){
if(head.next == head){
head.next=elem;
head.prev=elem;
elem.next=head;
elem.prev=head;
}else{
element cur = head;
while(cur.next!=head){
cur = c... | 12pi-algs | trunk/AntonPozdeev/11.Двусвязный список/spisok.java | Java | mit | 1,008 |