All |
Popular |
Newest |
Recently Updated |
Highest Rated

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

# Highest rated algorithms

- round_corners [edit] v0.2
*Round the corners of an image. Transparency and anti-aliasing are supported.* - stock_ticker [edit] v3.2
*Generate an HTML stock ticker with current quotes.* - show_address [edit] v0.6
*Given an address, show the location on a map.* - duotone_image [edit] v0.5
*Change an image into a tinted grayscale.* - sort_multi_array [edit] v0.1
*Sort a two-dimensional array by one (or more) of the elements in the nested arrays. Accepts a variable number of arguments.* - weather_forecast [edit] v1.4
*Display the weather for a location. Look up using the Google weather API.* - rotate_image_alpha [edit] v0.3
*Rotate an image paying respect to transparency.* - draw_cube [edit] v0.8
*Draw a 3d cube.* - create_gradient [edit] v0.1
*Create an image that is a color gradient.* - draw_mandelbrot [edit] v0.1
*Draw the Mandelbrot set fractal. See http://en.wikipedia.org/wiki/Mandelbrot_set* - diceRoll [edit] v0.2
*Rolls a number of dice and returns the results of each roll as well as the total.* - blur_image [edit] v0.1
*Blur an image.* - draw_upc_barcode [edit] v0.3
*Draw a barcode for a UPC number.* - gcd_euclid [edit] v0.1
*Find the greatest common divisor (also known as the greatest common factor or highest common factor) of two numbers using the Euclidean algorithm.* - hailstone [edit] v0.3
*Calculates a hailstone sequence. http://en.wikipedia.org/wiki/Collatz_conjecture* - markup_urls [edit] v0.4
*Mark up text by turning URLs and email addresses into links.* - unique_image [edit] v0.3
*Generate a pseudo-unique "hash" image based on a string.* - allocate_color [edit] v0.2
*Helper function to allocate a color to an image. Color should be a 6-character hex string.* - blend_colors [edit] v0.1
*Combine two colors into one.* - bubble_sort [edit] v0.2
*Implementation of the "bubble" sorting method. It repeatedly traverses the array to be sorted, swapping adjacent items that are out of order. It stops once the array is traversed with no swaps.*