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

# Recently updated algorithms

- bogosort [edit] v0.1
*An extremely inefficient sorting method. The array is randomly shuffled until it is sorted.* - sorted [edit] v0.1
*Check if an array is sorted.* - binary_search [edit] v0.1
*Search a SORTED array for an item using the binary search method. Check the middle of the array to see if it is the item. If not, search either the lower half or the upper half depending on whether the middle item is greater or lesser than the item. Returns the index of the item, or -1 if item is not found.* - draw_bezier [edit] v0.1
*Draw a Bezier curve specified by the four points p0, p1, p2, p3.* - point_in_polygon [edit] v0.1
*Check to see if a point is within a polygon.* - time2seconds [edit] v0.2
*Convert a time like HH:MM:SS into the number of seconds.* - number_commas [edit] v0.1
*Add commas to a number, returning a string.* - pie_chart [edit] v0.1
*Draw a pie chart. To do: add labels.* - generate_graph_color [edit] v0.6
*Generate a color from a number (between 0 and 26). Colors would be suitable for bars in a bar chart for example. Adjacent colors clash.* - unique_image [edit] v0.3
*Generate a pseudo-unique "hash" image based on a string.* - filter_profanity [edit] v0.1
*Censor the swearing in text.* - simplify_equation [edit] v0.2
*Simplify an equation.* - pluralize [edit] v0.3
*Form the plural of an English noun.* - validate_phone [edit] v0.1
*Validate an American/Canadian phone number.* - word_counts [edit] v0.2
*Return an array recording the number of occurrences of each unique word in the text.* - text_cloud [edit] v0.1
*Create a tag cloud based on the frequencies of the words in a piece of text.* - indefinite_article [edit] v0.1
*Put the correct indefinite article (a or an) in front of a word.* - lcm [edit] v0.1
*Find the least common multiple (a.k.a. lowest common multiple, smallest common multiple or lowest common denominator) of two numbers.* - 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.* - draw_playing_card [edit] v0.1
*Use CSS to draw a playing card - no images are used.*