Problem 2: Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … By considering the terms in the Fibonacci […]

Read more →Problem 1: If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000. Haskell Solutions […]

Read more →Another common script is the bubble sort. Although I do not recommend using it as it is too slow as compared to the other sorting algorithms like merge sort and quick sort, it is worth knowing how it is done. The basic idea is to compare every […]

Read more →Its almost the end of the semester, and after that everyone will be out looking for a job. One thing i have noticed is that most entrance exams for programming involves some sort of a test whether you know how to code. Most of these exams would […]

Read more →