TiagoRG
/
uaveiro-leci
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Aula09 - Exs 6 and 7 added

This commit is contained in:
TiagoRG 2022-12-21 10:37:42 +00:00
parent f6f40012fc
commit baf21db117
Signed by untrusted user who does not match committer: TiagoRG
GPG Key ID: DFCD48E3F420DB42
3 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
1ano/fp/aula09/README.md
View File

@ -1,7 +1,7 @@
# Fundamentos de Programação # Fundamentos de Programação
## Aula 09 - [Slides](https://github.com/TiagoRG/uaveiro-leci/blob/master/1ano/fp/slides/tp09-searching+sorting.pdf) ## Aula 09 - [Slides](https://github.com/TiagoRG/uaveiro-leci/blob/master/1ano/fp/slides/tp09-searching+sorting.pdf)
### Tópicos principais da aula: Searching, Sorting, Lambda Expressions ### Tópicos principais da aula: Searching, Sorting, Lambda Expressions
#### Exercícios feitos: 1, 2, 3 #### Exercícios feitos: 1, 2, 3, 6, 7
--- ---
*Pode conter erros, caso encontre algum, crie um* [*ticket*](https://github.com/TiagoRG/uaveiro-leci/issues/new) *Pode conter erros, caso encontre algum, crie um* [*ticket*](https://github.com/TiagoRG/uaveiro-leci/issues/new)

6
1ano/fp/aula09/insertionSort.py
View File

@ -3,14 +3,14 @@
# using the insertion sort algorithm. # using the insertion sort algorithm.
# Modify it to accept a key= keyword argument that works like in list.sort. # Modify it to accept a key= keyword argument that works like in list.sort.
def insertionSort(lst): def insertionSort(lst, key=None):
# Traverse elements starting at position 1 # Traverse elements starting at position 1
for i in range(1, len(lst)): for i in range(1, len(lst)):
# We know that lst[:i] is sorted # We know that lst[:i] is sorted
x = lst[i] # x is the element to insert next x = lst[i] # x is the element to insert next
# Elements in lst[:i] that are > x must move one position ahead # Elements in lst[:i] that are > x must move one position ahead
j = i - 1 j = i - 1
while j >= 0 and lst[j] > x: while j >= 0 and (key(lst[j]) > key(x) if key else lst[j] > x):
lst[j + 1] = lst[j] lst[j + 1] = lst[j]
j -= 1 j -= 1
# Then put x in the last emptied slot # Then put x in the last emptied slot
@ -19,7 +19,6 @@ def insertionSort(lst):
return return
def main(): def main():
# Original list # Original list
lst0 = ["paulo", "augusto", "maria", "paula", "bernardo", "tito"] lst0 = ["paulo", "augusto", "maria", "paula", "bernardo", "tito"]
@ -46,6 +45,7 @@ def main():
print("All tests OK!") print("All tests OK!")
if __name__ == "__main__": if __name__ == "__main__":
main() main()

4
1ano/fp/aula09/polynomial.py
View File

@ -4,7 +4,7 @@
# polynomial2(a,b,c) deve devolver uma função f tal que # polynomial2(a,b,c) deve devolver uma função f tal que
# f(x) seja o polinómio de segundo grau ax²+bx+c. # f(x) seja o polinómio de segundo grau ax²+bx+c.
def polynomial2(a, b, c): def polynomial2(a, b, c):
... return lambda x: a*x**2 + b*x + c
# DESAFIO EXTRA: # DESAFIO EXTRA:
@ -14,7 +14,7 @@ def polynomial2(a, b, c):
# polynomial(a), onde a=[a0, a1, ..., an], deve devolver uma função f tal que # polynomial(a), onde a=[a0, a1, ..., an], deve devolver uma função f tal que
# f(x) seja o polinómio a0*x**n + a1*x**(n-1) + ... + an. # f(x) seja o polinómio a0*x**n + a1*x**(n-1) + ... + an.
def polynomial(coefs): def polynomial(coefs):
... return lambda x: sum([coefs[i]*x**(len(coefs)-i-1) for i in range(len(coefs))])
def main(): def main():