Programming and Web Development Help

Welcome to Dream.In.Code
	Become an Expert! Join 306,790 Programmers for FREE! Get instant access to thousands of experts, tutorials, code snippets, and more! There are 1,578 people online right now. Registration is fast and FREE... Join Now! Chat LIVE With a Expert

's Contributions

Below are the tutorials, code snippets, and resources has submitted to dream.in.code. For more information on Kudos and contributing to dream.in.code visit: http://home.dreamincode.net/?p=about#kudos.

Tutorials

Control statements in java, if-else statements in Java Tutorials (Last Comment: , Views: 5,706)

Code Snippets

	Binary Search in Java by mostyfriedman
	Submitted: November 11, 2008 Views: 326

Deleted: ~~Calculating the number of permutations P(n, r)~~ in Java by mostyfriedman

Submitted: July 4, 2009 Views: 64

given n and r, the sippets calculates the number of different permutations to choose r elements from n. The formula for P(n, r) = n!/(n-r)! but of course if n is large it will be very inefficient to compute the factorial first then plug it in the formula, instead we can use this property that P(n, r) = P(n, r-1)*n-(r-1) and that P(n, 0) = 1 and P(n, 1) = n. it can be done using an array and on each iteration we look at the previous cell which holds the value for p(n,k-1) or to save memory we can instead accumulate the result in a variable.

Calculating the number of permutations P(n, r) in Java by mostyfriedman

Submitted: July 5, 2009 Views: 196

given n and r, the snippet calculates the number of different permutations to choose r elements from n elements. The formula for P(n, r) = n!/(n-r)! but of course if n is large it will be very inefficient to compute the factorial first then plug it in the formula, instead we can use this property that P(n, r) = P(n, r-1)*n-(r-1) and that P(n, 0) = 1 and P(n, 1) = n. it can be done using an array of size r and on each iteration we look at the previous cell which holds the value for p(n,i-1) or to save memory we can instead accumulate the result in a variable.

	Checks if a number is prime or not in PROLOG in Other Languages by mostyfriedman
	Submitted: March 29, 2009 Views: 430 a snippet in PROLOG that checks if a number is prime or not

Computing the Binomal Coefficient (a dynamic programming approach) in Java by mostyfriedman

Submitted: July 1, 2009 Views: 265

just a small snippet to compute the binomial Coefficient nCk.. mathematically to compute the binomial coefficient ncK = n!/k!(n-k)! but if n is too large, computing it will be very inefficient, instead there's a recursive formula nCk = (n-1)C(k-1)+(n-1)Ck, so this can be used in a dynamic programming approach...also to speed things up, binomial Coefficients have this identity that nCk = nC(n-k), so we can use this to minimize the number of terms computed

	Factorial in prolog in Other Languages by mostyfriedman
	Submitted: March 27, 2009 Views: 679 the predicate returns true if Y is the factorial of X

	Fibonacci even sum in Java by mostyfriedman
	Submitted: November 15, 2008 Views: 317 my solution to a problem that i solved on www.projecteuler.net...this method sums the even terms in the fibonacci series that aren't greater than n

	Fibonacci in prolog in Other Languages by mostyfriedman
	Submitted: March 25, 2009 Views: 1308 an example of the fibonacci series in prolog, the function will return true, if Y is the fibonacci value of X

	Finding all permutations of a list(PROLOG) in Other Languages by mostyfriedman
	Submitted: April 9, 2009 Views: 546 a snippet that lists all the possible permutations of a list

	GCD in prolog in Other Languages by mostyfriedman
	Submitted: March 25, 2009 Views: 577 a simple snippet in prolog to find the greatest common divisor of 2 numbers

	Insertion sort of a list (PROLOG) in Other Languages by mostyfriedman
	Submitted: April 20, 2009 Views: 324 the predicate insertionsort returns true if R is the sorted list of [H\|T]

	Logical expressions in Other Languages by mostyfriedman
	Submitted: August 8, 2009 Views: 40 a snippet that evaluates and simplifies logical expressions

	Palindrome checker in Java by mostyfriedman
	Submitted: November 29, 2008 Views: 578 checks whether a string is a palindrome or not..a palindrome is a string that could be read backwards the same way it could be read forward example: mom dad

	Palindrome checker using recursion in Java by mostyfriedman
	Submitted: January 3, 2009 Views: 2317 checks if the given string is a palindrome using recursion.

	Prime Factorisation in Java by mostyfriedman
	Submitted: December 29, 2008 Views: 782 a small algorithm to find the prime factors of a number

	Prime number tester (HASKELL) in Other Languages by mostyfriedman
	Submitted: April 21, 2009 Views: 382 the function isprime finds if the number is prime or not

	Reversing a list (PROLOG) in Other Languages by mostyfriedman
	Submitted: April 9, 2009 Views: 252 a simple snippet to reverse a list in prolog

	Selection Sort in java in Java by mostyfriedman
	Submitted: February 18, 2009 Views: 390

	Selection sort of a list (PROLOG) in Other Languages by mostyfriedman
	Submitted: April 20, 2009 Views: 327 the predicate returns true if [X\|Z] is the ordered representation of list R

	String Permutations in Java by mostyfriedman
	Submitted: September 15, 2009 Views: 57 finding all permutations of a string recursively

	Sum of digits in a positive integer in Java by mostyfriedman
	Submitted: November 19, 2008 Views: 1853 this method takes an integer as an argument and returns the sum of digits in that integer. Example: if the integer is 123, the method will return 1+2+3 = 6.

	Sum of digits of a number (in PROLOG) in Other Languages by mostyfriedman
	Submitted: March 29, 2009 Views: 483 a simple snippet to find the sum of digits of a given number in PROLOG

Programming Help

Web Development

What's Here?