aleph.nu

aleph.nu

Mon 13 April 2015. The python road not taken. Sat 13 October 2012. Upstart script section exits prematurely. Sat 04 February 2012. Finding the most repeated value in an array. Sun 01 January 2012. Lower bound on finding the k-smallest elements in sorted order. Sat 17 December 2011. Refresh browser when html or css changes. Sat 10 December 2011. Solving the selection problem given the im/n smallest element. Thu 08 December 2011. Kth smallest element in union of sorted arrays. Sat 04 June 2011.

http://www.aleph.nu/

OVERVIEW OF aleph.nu

TRAFFIC RANK

>1,000,000

REVIEWS

0

PAGES IN THIS WEBSITE

13

LINKS TO THIS WEBSITE

CONTACTS

ADDRESSES

SOCIAL LINKS

ONLINE SINCE

WEBSITE DETAILS

SEO

PAGES

SIMILAR SITES

TRAFFIC RANK FOR ALEPH.NU

TODAY'S RATING

>1,000,000

TRAFFIC RANK - AVERAGE PER MONTH

BEST MONTH

December

AVERAGE PER DAY Of THE WEEK

HIGHEST TRAFFIC ON

Friday

TRAFFIC BY CITY

Sign up

CUSTOMER REVIEWS

Average Rating: 3.0 out of 5 with 2 reviews

5 star

0

4 star

0

3 star

2

2 star

0

1 star

0

Hey there! Start your review of aleph.nu

AVERAGE USER RATING

Write a Review

WEBSITE PREVIEW

LOAD TIME

1 seconds

CONTACTS AT ALEPH.NU

ADD CONTACT

Login

TO VIEW CONTACTS

Remove Contacts

FOR PRIVACY ISSUES

CONTENT

PAGES IN
THIS WEBSITE

13

SSL

EXTERNAL LINKS

1

SITE IP

192.30.252.154

LOAD TIME

1.048 sec

SCORE

6.2

PAGE TITLE

aleph.nu | aleph.nu Reviews

<META> DESCRIPTION

Mon 13 April 2015. The python road not taken. Sat 13 October 2012. Upstart script section exits prematurely. Sat 04 February 2012. Finding the most repeated value in an array. Sun 01 January 2012. Lower bound on finding the k-smallest elements in sorted order. Sat 17 December 2011. Refresh browser when html or css changes. Sat 10 December 2011. Solving the selection problem given the im/n smallest element. Thu 08 December 2011. Kth smallest element in union of sorted arrays. Sat 04 June 2011.

<META> KEYWORDS

1 toggle navigation

2 university

3 tags

4 the filecache decorator

5 alephnu

6 powered by pelican

7 and nikhil

8 coupons

9 reviews

10 scam

CONTENT

Page content here

KEYWORDS ON PAGE

toggle navigation,university,tags,the filecache decorator,alephnu,powered by pelican,and nikhil

SERVER

GitHub.com

CONTENT-TYPE

utf-8

GOOGLE PREVIEW

aleph.nu | aleph.nu Reviews

https://aleph.nu

Mon 13 April 2015. The python road not taken. Sat 13 October 2012. Upstart script section exits prematurely. Sat 04 February 2012. Finding the most repeated value in an array. Sun 01 January 2012. Lower bound on finding the k-smallest elements in sorted order. Sat 17 December 2011. Refresh browser when html or css changes. Sat 10 December 2011. Solving the selection problem given the im/n smallest element. Thu 08 December 2011. Kth smallest element in union of sorted arrays. Sat 04 June 2011.

INTERNAL PAGES

aleph.nu

1

the filecache decorator - aleph.nu

http://aleph.nu/blog/2011/the-filecache-decorator

Sat 04 June 2011. The past week or so I've been working on a new decorator. That tracks files under the .hg/ directory for changes. In short, you use it on a method and it turns it to a property with caching the result, like propertycache. But it also gives you the ability to invalidate the cached property, which triggers a stat(2) call that checks if the file behind the property changed since the last time it was read. File x is modified. File x is read, inserted to the cache. We end up with file x from...

2

finding the most repeated value in an array - aleph.nu

http://aleph.nu/blog/2012/finding-the-most-repeated-value-in-an-array

Finding the most repeated value in an array. Sat 04 February 2012. An array of length. Distinct elements, (k lt n ). Find the most repeated value in the array. Note that this isn't the same as finding the majority (if there is one) in an array which can be done in ( Theta(n) ). By finding the median or using the more simplistic Boyer-Moore Majority Vote Algorithm). The straight forward solution gives us ( Theta(n lg{n}) ). We can slightly improve this to ( Theta(n lg{k}) ). By using (O(k) ).

3

university - aleph.nu

http://aleph.nu/university

פתרונות למטלות מהאוניברסיטה הפתוחה. ניתן למצוא כאן את המטלות שכתבתי במחשב במהלך לימודיי באוניברסיטה הפתוחה. את המטלות כתבתי ב-LaTeX (קומפלו בעזרת XeTeX). מעבדה בתכנות, 20465 מטלות 2015א. פרויקט סיום, מימוש של קומפיילר. מערכות הפעלה, 20594 מטלות 2015א. שפות תכנות, 20905 מטלות 2014ב. קומפילציה, 20364 מטלות 2014א. פרויקט סיום, מימוש קומפיילר ל-CPL ב-python. אלגוריתמיקה, 20290 מטלות 2013ג. אוטומטים ושפות פורמליות, 20440 מטלות 2013ב. מבוא לאלגוריתמים, 20407 מטלות 2012א. הסבר יחסית מפורט לשאלה 3 נמצא כאן.

4

kth smallest element in union of sorted arrays - aleph.nu

http://aleph.nu/blog/2011/kth-smallest-element-in-union-of-sorted-arrays

Kth smallest element in union of sorted arrays. Thu 08 December 2011. Given two sorted arrays A and B of length n, find the kth smallest element in the union of the two arrays (imagine the two arrays are merged into one sorted array of length 2n). Do so in $ Theta ( lg n) $. If we pick two elements, (A[i] ). And look at the bigger of the two, let it be (A[i] ). We know that it is at least. The (i j ). Smallest element in (A cup B ). Because it is bigger than everything in (A[1.i-1] ). And (B[1.j] ).

5

sub-second precision is not enough - aleph.nu

http://aleph.nu/blog/2011/sub-second-precision-is-not-enough

Sub-second precision is not enough. Sat 04 June 2011. Turns out relying on st mtime having sub-second precision is not reliable enough, as this small test demonstrates:. Touch a b ;. Grep Modify Modify: 2011-07-28 15:36:19.505160175 0300 Modify: 2011-07-28 15:36:19.505160175 0300. Opening one more process seems to delay enough to show a difference:. Touch a ;. Touch b ;. Grep Modify Modify: 2011-07-28 15:37:50.082659665 0300 Modify: 2011-07-28 15:37:50.085158931 0300. Diffs out of 10000 iterations.

UPGRADE TO PREMIUM TO VIEW 8 MORE

TOTAL PAGES IN THIS WEBSITE

13

LINKS TO THIS WEBSITE

github.com

idank (Idan Kamara) · GitHub

https://github.com/idank

Http:/ www.aleph.nu. Dec 21, 2011. Match command-line arguments to their help text. Python parser for bash. Source man pages for explainshell.com. A Python Static Website Generator. 135 contributions in the last year. Summary of pull requests, issues opened, and commits. Learn how we count contributions. Idank has no activity during this period. You can't perform that action at this time. You signed in with another tab or window. Reload. To refresh your session. To refresh your session.

UPGRADE TO PREMIUM TO VIEW 0 MORE

TOTAL LINKS TO THIS WEBSITE

1

SOCIAL ENGAGEMENT

idanksf

OTHER SITES

aleph.nkp.cz

NKC - Konec relace

aleph.nl

Dispuut Aleph

We hebben 2 gasten online. Zoek je een kamer? Vrijdag 12 december 2014 14:17. Begrafenis Hein (82) 13-12-2014. Waarde Aleph-leden en -reünisten,. Aanstaande zaterdag is de begrafenis van waarde Hein in Waalre om 12:00 uur. Naderhand zal de familie met de genodigden (dus in beperkt gezelschap, een besloten bijeenkomst) naar Het Stations Koffie Huis gaan. Dinsdag 09 december 2014 10:44. Waarde Aleph leden,. Een jaar geleden vierden we een lustrum waar Hein bij was. Het was voor sommigen voor het eerst ...

aleph.nli.org.il

Aleph main menu

aleph.nottingham.ac.uk

Aleph main menu

aleph.nottingham.edu.cn

Aleph main menu

aleph.nu

Mon 13 April 2015. The python road not taken. Sat 13 October 2012. Upstart script section exits prematurely. Sat 04 February 2012. Finding the most repeated value in an array. Sun 01 January 2012. Lower bound on finding the k-smallest elements in sorted order. Sat 17 December 2011. Refresh browser when html or css changes. Sat 10 December 2011. Solving the selection problem given the im/n smallest element. Thu 08 December 2011. Kth smallest element in union of sorted arrays. Sat 04 June 2011.

Aleph main menu

Aleph main menu

Aleph main menu

Aleph main menu

Aleph main menu