Perceiving beauty

  • 4,342 views
Uploaded on

My quick talk in 'Write Beautiful Code' HackerEarth Event in Dexetra, Bangalore. Not much text and borrowed a lot of stuff from Hannson and Cormen!

My quick talk in 'Write Beautiful Code' HackerEarth Event in Dexetra, Bangalore. Not much text and borrowed a lot of stuff from Hannson and Cormen!

More in: Business , Technology
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
No Downloads

Views

Total Views
4,342
On Slideshare
0
From Embeds
0
Number of Embeds
11

Actions

Shares
Downloads
55
Comments
2
Likes
22

Embeds 0

No embeds

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
    No notes for slide

Transcript

  • 1. PERCEIVING BEAUTY Sriram V Iyer
  • 2. BORROWING FROM HANNSON Beauty Leads to Happiness
  • 3. Happiness Leads to productivity ….. So,
  • 4. Beauty leads to Productivity 
  • 5. You can recognize truth by its beauty and simplicity. When you get it right, it is obvious that it is right. - Richard Feynman
  • 6. Perfection is achieved, not when there is nothing more to add, but when there is nothing left to take away -Antoine de Saint-Exupery
  • 7. vs
  • 8. LESS IS MORE (BEAUTIFUL) l = [ 3, 7, 8, 6, 5, 11 ] q = [] for i in range( len(l) ): q.insert( l[i] * 2 )
  • 9. LESS IS MORE (BEAUTIFUL) def dbl(x): return x * 2 l = [ 3, 7, 8, 6, 5, 11 ] q = [] for i in range( len(l) ): q.insert( dbl (l[i]) )
  • 10. LESS IS MORE (BEAUTIFUL) def dbl(x): return x * 2 l = [ 3, 7, 8, 6, 5, 11 ] q = map( dbl, l )
  • 11. LESS IS MORE (BEAUTIFUL) l = [ 3, 7, 8, 6, 5, 11 ] q = [ x * 2 for x in l ] # Double only odd numbers? …
  • 12. LESS IS MORE (BEAUTIFUL) q = [ x * 2 for x in l if not (x % 2) ] VS q = map( lambda x : x * 2, filter(lambda y : y % 2 != 0, l ) )
  • 13. ATTITUDE IS NO SUBSTITUTE FOR COMPETENCE O(n) = log n VS O(n) = n log n
  • 14. KNOWING IS EVERYTHING Insertion Sort (n^2) vs Merge Sort (n log(n)) Computer A 10,000 MIPS vs Computer B 10 MIPS Number of items to be Sorted Insertion Sort or Computer A Merge Sort on Computer B 10 Million 5.5 Hours 17 mins 100 Million 23 Days 4 hours
  • 15. THANK YOU!