Skip to content

Instantly share code, notes, and snippets.

@kuzemkon
kuzemkon / bash
Created August 5, 2016 19:33
VirtualBox links setup
# if running inside VirtualBox on a shared folder
# you must enable symlinks on the shared folder
$ VBoxManage setextradata "<vm name>" VBoxInternal2/SharedFoldersEnableSymlinksCreate/<shared folder> 1
# verify with
$ VBoxManage getextradata "<vm name>" enumerate
@kuzemkon
kuzemkon / Hash.java
Created June 13, 2016 15:02
Hash tables open addressing
public class OpenAdressing {
private int length;
private int[] result;
private int c1, c2;
private String method;
OpenAdressing(int length){
this.length = length;
result = new int[length];
this.method = "linear";
arrayIni();
@kuzemkon
kuzemkon / Hash.java
Created June 13, 2016 15:00
Hash tables link collision
public class LinkCollision {
private ArrayList<Integer>[] result;
private int length;
private double hashWay;
LinkCollision(int length, double hashWay){
this.length = length;
this.hashWay = hashWay;
this.result = new ArrayList[length];
resultIn();
}
@kuzemkon
kuzemkon / Sort.java
Created June 13, 2016 14:21
Counting Sorting
public class Sort {
private int[] A;
private int[] B;
private int[] C;
private int k;
public Sort(int[] array, int k){
this.B = this.countingSort(array,k);
}
private int[] countingSort(int[] a, int k) {
int c[] = new int[k];
@kuzemkon
kuzemkon / Sort.java
Created June 13, 2016 14:19
Radix Sorting
public class Radix {
private int[] array = new int[11];
public Radix(int[] array){
sort(array);
}
private void sort( int[] a)
{
int i, m = a[0], exp = 1, n = a.length;
// int[] b = new int[10];
for (i = 1; i < n; i++)
@kuzemkon
kuzemkon / Sort.java
Created June 13, 2016 13:57
Quick Sorting
package web.cheff;
import java.util.Random;
/**
* Created by yura on 30.03.16.
*/
public class Sort {
private int[] sorted;
private int found;
@kuzemkon
kuzemkon / MergeSort.java
Created June 13, 2016 12:34
Merge Sorting
public class MergeSort {
private int[] data;
private void merge(int arr[], int l, int m, int r) {
int n1 = m - l + 1;
int n2 = r - m;
int L[] = new int[n1];
int R[] = new int[n2];
@kuzemkon
kuzemkon / Heap.java
Created June 13, 2016 12:19
Heap sorting and priority queue
public class Sort {
private int[] a;
private int n;
private int left;
private int right;
private int largest;
Sort(int[] array){
sort(array);
}
@kuzemkon
kuzemkon / domain.conf
Created April 20, 2016 13:33
Default apache2 host config
<VirtualHost *:80>
ServerName selfiecam.in.ua
ServerAdmin [email protected]
DocumentRoot /var/www/domain
<Directory /var/www/domain/>
Options Indexes FollowSymLinks MultiViews
AllowOverride All
Order allow,deny
allow from all
// клас списку
public class Link {
public String value;
public int index;
public Link next;
public SampleForm form;
public Link(String value, int index){
this.value = value;
this.index = index;
}