zr-faisal/apple-ios-samples
Public repository.
:iphone: Collaborative List of Open-Source iOS Apps
Public repository record indexed from GitHub. Explore verified star velocity metrics, source code repositories, and curated developer tool directories across the GitHubRepo ecosystem.
Public repository.
Home screen widget for Android 4.2+
This is a small code in Python for finding the Prime numbers within any given range of integers. Here I saved all the prime numbers (from 2 to maximum-value-of-the-range ) in a list first. Later, all the prime numbers within the given range is saved in a separate list (prime_list_within_range). Because to make this code work faster I used a trick to find the prime numbers. That is, instead of dividing each number by all the integers between 1 and that number-itself inclusive, I divided each number by only the prime numbers smaller than it. If the number is divided by any smaller prime numbers, then its not a prime number. Interestingly, when the first number 2 was divided by the elements of the initial empty prime_list, it passed the condition to be a prime number. :) Now, since I used the list of prime numbers to find other prime numbers, I had to make that list from the beginning (from 2) regardless of the given range. Therefore, I had to use two lists here.
A digital road trip through Kimbra’s track under the same name.