Snipplr

(Pascal) Ejercicio 33 - Algoritmo ordenamiento - MauricioM

Wed, 08 May 2013 13:29:52 GMT

Técnicas de Programación. Ejercicio 33 - Algoritmo selección (usando un array auxiliar)

(C++) Mutant Encryption Algorithm - eiger824

Thu, 21 Feb 2013 08:18:26 GMT

This piece of code is aimed to encrypt passwords, but this time it won't return a single character array, but a constantly-changing matrix which contains the password.

(PHP) Fake Credit Card Checker - quixrick

Tue, 18 Dec 2012 08:55:10 GMT

This function checks to see if a credit card number cannot possibly be valid. Note: It does NOT check if a card is valid. A card number can pass this check and still be invalid, but this script will identify card numbers that cannot possibly be valid.

(Java) Quicksort in Java, with Enforced Suckitude - rtperson

Tue, 08 May 2012 00:02:25 GMT

It's no fun implementing QuickSort unless you can force it out of its blister-fast, O(n log n) speed and humiliate it with its worst-case, O(n^2) runtime. So that's what I set out to do. My naive partition simply pivots around the low item, but my randomized partition defeats the sucky inputs by choosing a random pivot. (If you're interested in checking out a QuickSort which naively partitions until it hits an attempt to get it to run in quadratic time, check out IntroSort -- which simply fails over to Merge Sort when it exceeds its optimal recursion depth.)

(JavaScript) JavaScript Binary Search - jatkins

Fri, 27 Apr 2012 07:18:43 GMT

Released into the public domain.

(JavaScript) insertion sort - eryoav

Sat, 03 Mar 2012 17:38:33 GMT

insertion sort

(JavaScript) Binary Search - eryoav

Sat, 25 Feb 2012 17:57:38 GMT

simple binary search algorithm

(Java) Quick Sort - jsmith

Tue, 10 Jan 2012 18:28:42 GMT

(Java) Selection sort - jsmith

Tue, 10 Jan 2012 18:28:40 GMT

(Java) Merge Sort - jsmith

Tue, 10 Jan 2012 18:28:38 GMT

(Java) Insertion Sort - jsmith

Tue, 10 Jan 2012 18:28:24 GMT

(Java) Bubble Sort - jsmith

Tue, 10 Jan 2012 18:28:10 GMT

(C) Dijkstra\'s Shortest Path algorithm - stakisko

Wed, 09 Nov 2011 22:37:02 GMT

Its Dijkstra's Shortest Path algorithm written in C. Reads from a file the nodes and the connected edges and implements Dijkstra's algorithm. I am uploading for your comments in my code. Thank you. Files content should be in the format: n N startNode endNode distance startNode endNode distance . . . startNode endNode distance where n is the total number of Nodes and N is the total number of Acnes.

(Haskell) Haskell 99 Problems, numbers 1 through 9 - rtperson

Thu, 08 Sep 2011 00:23:54 GMT

I had originally started these problems from #10 (Run-length encoding). I went back and did 1-8 for completeness.

(JavaScript) Bresenham\'s Line Algorithm - nefd

Wed, 31 Aug 2011 00:07:22 GMT

Code obtained from a [stackoverflow question](http://stackoverflow.com/questions/4672279/bresenham-algorithm-in-javascript). This is a javascript implementation of the [Bresenham line algorithm](http://en.wikipedia.org/wiki/Bresenham's_line_algorithm). Given two points, this function will return an array of coordinates which go from point A to point B, one step at a time.

(Haskell) Haskell 99 Problems - Number 20, Arrowed! - rtperson

Thu, 25 Aug 2011 01:54:30 GMT

problem 20, (*) Remove the K'th element from a list *Main> removeAt 1 "abcd" "acd" Trivial using a pure function. A bit more challenging if you use this problem to work up your Arrow-fu.

(Haskell) Haskell 99 Problems - Number 18 and 19 - rtperson

Sun, 21 Aug 2011 01:58:02 GMT

Problem 18: Extract a slice from a list. Given two indices, i and k, the slice is the list containing the elements between the i'th and k'th element of the original list (both limits included). Start counting the elements with 1. Example: *Main> slice ['a','b','c','d','e','f','g','h','i','k'] 3 7 "cdefg 9 Problem 19 - Rotate a list N places to the left. *Main> rotate ['a','b','c','d','e','f','g','h'] 3 "defghabc" *Main> rotate ['a','b','c','d','e','f','g','h'] (-2) "ghabcdef" (This one is so easy it feels like cheating...)

(Haskell) Haskell 99 Problems - Solutions to 11 and 12 - rtperson

Fri, 29 Jul 2011 08:03:55 GMT

problem 11, modified run-length encoding ======================================== If an element has no duplicates, mark it as such. Example: encodeModified "aaaabccaadeeee" [Multiple 4 'a',Single 'b',Multiple 2 'c', Multiple 2 'a',Single 'd',Multiple 4 'e'] problem 12, Decode a run-length encoded list. ============================================= Given a run-length code list generated as specified in problem 11. Construct its uncompressed version. Example: decodeModified [Multiple 4 'a',Single 'b',Multiple 2 'c', Multiple 2 'a',Single 'd',Multiple 4 'e'] "aaaabccaadeeee"

(Haskell) Run-Length Encoding in Haskell - rtperson

Fri, 29 Jul 2011 06:08:49 GMT

Problem 10 of the famous 99 Problems. I got 99 problems, but a Lisp ain't one.

(Java) Travelling Salesman Problem >> Java - s1w

Mon, 13 Jun 2011 04:11:38 GMT

[start_tsp.bat] file should be made for launching: start "output" java -jar TSP.jar