Pinned Loading

1. SICP Exercise 3.18 SICP Exercise 3.18

   1

   ; Tortoise and Hare algorithm

   2

   ; This works by having two pointers crossing the list

   3

   ; One moves fast (hare), the other moves slowly (tortoise)

   4

   ; If at a given moment in time both matches it means that there's a cycle

   5

   ; This algorithm runs with constant space 

2. SICP Exercise 3.18 SICP Exercise 3.18

   1

   ; Keep a list of the visited nodes

   2

   ; While crossing the list, check if the current node is on the visited list of nodes

   3

   ; If true, it's circular

   4

   5

   ; Using eq?, we can implement a useful procedure called memq. 

3. Implementing functions to calculate ... Implementing functions to calculate the largest prime factor of a given number

   1

   (defn primes-iter

   2

   	[primes candidate limit]

   3

   	(letfn [(is-prime? 

   4

   			 []

   5

   			 (->> primes

4. query-json query-json Public

   Search JSON using regex

   JavaScript 12 3