Download as ODP, PPTX
![Sintaxis: Loop
for e in [1, 5, “pepe”]:
print e](https://image.slidesharecdn.com/python101-170206154135/85/Python-101-21-320.jpg)
![Sintaxis
void bubble_sort (int *a, int n) {
int i, t, s = 1;
while (s) {
s = 0;
for (i = 1; i < n; i++) {
if (a[i] < a[i - 1]) {
t = a[i];
a[i] = a[i - 1];
a[i - 1] = t;
s = 1;
}
}
}
}
def bubble_sort(a):
s = True
while s:
s = False
for i in xrange(len(a) - 1):
if a[i] > a[i+1]:
a[i], a[i+1] = a[i+1], a[i]
s = True
return None](https://image.slidesharecdn.com/python101-170206154135/85/Python-101-22-320.jpg)
![Sintaxis
void bubble_sort (int *a, int n) {
int i, t, s = 1;
while (s) {
s = 0;
for (i = 1; i < n; i++) {
if (a[i] < a[i - 1]) {
t = a[i];
a[i] = a[i - 1];
a[i - 1] = t;
s = 1;
}
}
}
}
def bubble_sort(a):
s = True
while s:
s = False
for i in xrange(len(a) - 1):
if a[i] > a[i+1]:
a[i], a[i+1] = a[i+1], a[i]
s = True
return None](https://image.slidesharecdn.com/python101-170206154135/85/Python-101-23-320.jpg)
![Sintaxis ofuscada
void bubble_sort (int *a, int n) {int i, t, s = 1;while (s) {s = 0;
for (i = 1; i < n; i++) {if (a[i] < a[i - 1]) {t = a[i];a[i] = a[i - 1];a[i - 1] = t;s =
1;}}}}
def bubble_sort(a):
s = True
while s:
s = False
for i in xrange(len(a) - 1):
if a[i] > a[i+1]:
a[i], a[i+1] = a[i+1], a[i]
s = True
return None](https://image.slidesharecdn.com/python101-170206154135/85/Python-101-24-320.jpg)
![Sintaxis: Loop
for e in [1, 5, “pepe”]:
print e](https://image.slidesharecdn.com/python101-170206154135/75/Python-101-21-2048.jpg)
![Sintaxis
void bubble_sort (int *a, int n) {
int i, t, s = 1;
while (s) {
s = 0;
for (i = 1; i < n; i++) {
if (a[i] < a[i - 1]) {
t = a[i];
a[i] = a[i - 1];
a[i - 1] = t;
s = 1;
}
}
}
}
def bubble_sort(a):
s = True
while s:
s = False
for i in xrange(len(a) - 1):
if a[i] > a[i+1]:
a[i], a[i+1] = a[i+1], a[i]
s = True
return None](https://image.slidesharecdn.com/python101-170206154135/75/Python-101-22-2048.jpg)
![Sintaxis
void bubble_sort (int *a, int n) {
int i, t, s = 1;
while (s) {
s = 0;
for (i = 1; i < n; i++) {
if (a[i] < a[i - 1]) {
t = a[i];
a[i] = a[i - 1];
a[i - 1] = t;
s = 1;
}
}
}
}
def bubble_sort(a):
s = True
while s:
s = False
for i in xrange(len(a) - 1):
if a[i] > a[i+1]:
a[i], a[i+1] = a[i+1], a[i]
s = True
return None](https://image.slidesharecdn.com/python101-170206154135/75/Python-101-23-2048.jpg)
![Sintaxis ofuscada
void bubble_sort (int *a, int n) {int i, t, s = 1;while (s) {s = 0;
for (i = 1; i < n; i++) {if (a[i] < a[i - 1]) {t = a[i];a[i] = a[i - 1];a[i - 1] = t;s =
1;}}}}
def bubble_sort(a):
s = True
while s:
s = False
for i in xrange(len(a) - 1):
if a[i] > a[i+1]:
a[i], a[i+1] = a[i+1], a[i]
s = True
return None](https://image.slidesharecdn.com/python101-170206154135/75/Python-101-24-2048.jpg)
Python 101
- 1.
- 2.
- 3. Guido van Rossum Python's Benevolent Dictatorfor Life “In December 1989, I was looking for a "hobby" programming project that would keep me occupied during the week around Christmas”
- 4. Guido van Rossum “Idecided to write an interpreter for the new scripting language I had been thinking about lately: a descendant of ABC that would appeal to Unix/C hackers.”
- 5. Guido van Rossum ● CWI,Centrum Wiskunde & Informatica ● Google ● Dropbox
- 6.
- 7.
- 8. The zen ofpython Beautiful is better than ugly. Explicit is better than implicit. Simple is better than complex. Complex is better than complicated. Flat is better than nested. Sparse is better than dense. Readability counts. Special cases aren't special enough to break the rules. Although practicality beats purity. Errors should never pass silently. Unless explicitly silenced. In the face of ambiguity, refuse the temptation to guess. There should be one-- and preferably only one --obvious way to do it. Although that way may not be obvious at first unless you're Dutch. Now is better than never. Although never is often better than *right* now. If the implementation is hard to explain, it's a bad idea.
- 9. The zen ofpython Beautiful is better than ugly. Simple is better than complex. Flat is better than nested. Readability counts.
- 10. Fanatismo Premature optimization vsclarity Pythonic Pythonista
- 11.
- 12. Multiparadigma (Propósito general) Imperativo +procedural Orientado a Objetos Funcional - map / reduce / filter /comprehensions / generators
- 13. Features Tipado dinámico - Nose declaran variables - Las variables pueden cambiar de tipo en tiempo de ejecución Garbage collector Full unicode (utf8) support
- 14.
- 15. Sintaxis: Expresiones a =1 b = a + 2 a = “Hola” b = “ Mundo” print a + b
- 16.
- 17. Sintaxis: Convenciones if (condition){ /* statements */ } if (condition) { /* statements */ } if (condition) { /* statements */ } if (condition) { if (condition){ /* statements */ } if (condition) { /* statements */ } if (condition) { /* statements */ } if (condition) {/* statements if (condition){
- 18. Sintaxis: Convenciones Tabs vsEspacios
- 19. Sintaxis: Convenciones Tabs vsEspacios
- 20. Sintaxis: Control if a< b: print “a es” print “menor” else: print “a es mayor o igual”
- 21. Sintaxis: Loop for ein [1, 5, “pepe”]: print e
- 22. Sintaxis void bubble_sort (int*a, int n) { int i, t, s = 1; while (s) { s = 0; for (i = 1; i < n; i++) { if (a[i] < a[i - 1]) { t = a[i]; a[i] = a[i - 1]; a[i - 1] = t; s = 1; } } } } def bubble_sort(a): s = True while s: s = False for i in xrange(len(a) - 1): if a[i] > a[i+1]: a[i], a[i+1] = a[i+1], a[i] s = True return None
- 23. Sintaxis void bubble_sort (int*a, int n) { int i, t, s = 1; while (s) { s = 0; for (i = 1; i < n; i++) { if (a[i] < a[i - 1]) { t = a[i]; a[i] = a[i - 1]; a[i - 1] = t; s = 1; } } } } def bubble_sort(a): s = True while s: s = False for i in xrange(len(a) - 1): if a[i] > a[i+1]: a[i], a[i+1] = a[i+1], a[i] s = True return None
- 24. Sintaxis ofuscada void bubble_sort(int *a, int n) {int i, t, s = 1;while (s) {s = 0; for (i = 1; i < n; i++) {if (a[i] < a[i - 1]) {t = a[i];a[i] = a[i - 1];a[i - 1] = t;s = 1;}}}} def bubble_sort(a): s = True while s: s = False for i in xrange(len(a) - 1): if a[i] > a[i+1]: a[i], a[i+1] = a[i+1], a[i] s = True return None
- 25.
- 26.
- 27.
- 28. Me voy anode.js?
- 29. Me voy anode.js? NO Diferentes propósitos Node's early packaging
- 30.
- 31. Quién lo usa Infraestructura(scripting linux) Web sites Math experts Standalone PC apps
- 32.
- 33. Quien no lousa?
- 34. Quien no lousa? ¿Qué esperás?
- 35.