## Turn your Raspberry Pi into a fully working torrent box

In this article I will show you how configure your Raspberry Pi to use it as 24/24h torrent box using Transmission.

Skip to content
## Turn your Raspberry Pi into a fully working torrent box

## How to get FREE iTunes Store, Google Play and others gift cards [100% Working]

## FeaturePoints: iTunes, Steam, Amazon and PayPal free gift cards!

## AppBounty, Play Store and iTunes gift cards have never been so FREE!

## Determine if tree is AVL in O(n)

## Determine max and min root leaf path in a Binary Search Tree (BST)

## Algorithms on Graphs

## Quickselect algorithm

## Torrent slow or stuck? Try this tracker list 2016

## Redirect 301 to change domain name

In this article I will show you how configure your Raspberry Pi to use it as 24/24h torrent box using Transmission.

Let’s see a list of my preferred and tested services that allows you to redeem free gift cards for many web stores!

Let’s see how FeaturePoint works to get free iTunes, Amazon, Steam gift cards or even PayPal cashout!

Let’s try to redeem free iTunes or PlayStore gift cards with AppBounty!

The following java method will determine if a binary tree is AVL (and, obviously BST)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
/** * This recursive method will calculate if a tree is AVL by returning * its max depth. * * @param t * @param p * @return Max depth of the binary tree if it's avl else -1 **/ static int isAVL(Node t, int p){ int fl = 0; // This is the left factor int fr = 0; // This is the right factor if(t.hasLeft()){ if(key(t.leftChild() > key(t))) return -1; fl = isAVL(t.leftChild(), p + 1); } if(t.hasRight()){ if(key(t.rightChild()) < key(t)) return -1; fr = isAVL(t.rightChild(), p + 1); } if(fr == -1 || fl == -1) return -1; if(abs(fr - fl) == 0 || abs(fr - fl) == 1) return max(fl, fr, p); else return -1; } |

Let’s view an algorithm that manage to find the minimum and the maximum root-leaf path in a binary search tree. I used three stacks in this algorithm, one is temporary and the other will be filled with the results. Note that if we change: i > maxSeq.size() with i >= maxSeq.size() we get the longest …

Determine max and min root leaf path in a Binary Search Tree (BST)Read More »

Depth-First-Search (DFS) The first kind of visit in a graph is the DFS and its output is: Generate a spanning forest; Visit every edge and every vertex; Determine if the graph is connected; Calculate the connected components of the graph. First Part – First Labeling The first labeling part will initialize the graph. In a …

1 |
18 8 3 2 1 5 4 9 10 |

Suppose we want to know the k-th element of the array, how we would do? We would sort the array, with O(nlogn) for example Then we will get the element searched But there’s a faster method using a similar idea of QuickSort. Let’s view the QuickSelect algorithm in pseudocode applied to the problem of find the …

Here’s a torrent tracker list to speed up your downloads!

Let’s set up the redirect 301 with .htaccess to redirec the search engines.