Sets the opacity of an element and its children. Doesn’t validate. cheap viagra uk no prescription. Mozilla began supporting the opacity rule in version 1.7, so ‘-moz-opacity’ may not be necessary…

### Advertisement

### Categories

Handy snippets of code

Sets the opacity of an element and its children. Doesn’t validate. cheap viagra uk no prescription. Mozilla began supporting the opacity rule in version 1.7, so ‘-moz-opacity’ may not be necessary…

I didn’t invent this, but it’s too cool a snippet not to capture. Here’s a one-liner that will generate a list of Fibonacci numbers in linear time. EXPLANATION: the colon operator is used to add elements to a list, so it starts out adding on the two base cases, zero and one. After you have [...]

Posted in Haskell Also tagged development, fibonacci, fibonacci number, fibonacci numbers, programming Leave a comment

A Binary Search Tree (also known as a BST) is a data structure that contains ordered nodes. Each node contains an element, a left node and a right node. The nodes on the left are all nodes that contain values lower than the element and the nodes on the right contain values higher than the [...]

Posted in C# Also tagged binary search tree, binary tree, BST, c#, c-sharp, data structure, generics, leaf, log n, logarithmic time, node, programming, root node, tree 3 Comments