Serginho (footballer, born 1988)

Sérgio Paulo Nascimento Filho known as Serginho (born 27 April 1988) is a footballer who currently plays for Paysandu. He claimed that he has dual citizen of Brazil and Syria.

Serginho
Personal information
Full name Sérgio Paulo Nascimento Filho
Date of birth (1988-04-27) 27 April 1988
Place of birth Rio de Janeiro, Brazil
Height 1.83 m (6 ft 0 in)
Playing position(s) Defensive Midfielder
Club information
Current team
Paysandu
Senior career*
Years Team Apps (Gls)
2007–2010 CFZ 0 (0)
2009 → Atlético Tubarão (loan) 0 (0)
2009–2010Santa Cruz (loan) 0 (0)
2010 Grêmio Barueri 1 (0)
2011 Paraná 33 (1)
2012–2014 Bragantino 70 (5)
2012 → Ittihad Kalba (loan) 2 (0)
2014 Omonia 25 (1)
2015 Daegu FC 36 (4)
2016 Port 0 (0)
2016 Gangwon FC 17 (0)
2018 CRB 18 (0)
2019 Bangu 5 (0)
2019–2020 Petaling Jaya City 17 (4)
2020– Paysandu 0 (0)
* Senior club appearances and goals counted for the domestic league only and correct as of 19 February 2020

Biography

Sérgio Filho (literally Sérgio Jr. or Sérgio II), also known as Serginho (literally little Sérgio), started his career in CFZ. He signed his first professional contract in May 2007. In January 2009 he extended his contract to 31 December 2010 and left for Atlético Tubarão.[1] In March, at the mid of 2009 Campeonato Catarinense, he returned to Rio de Janeiro and played in 2009 Taça Rio.[2]

In October 2009 he left for Santa Cruz in 1-year loan,[3] winning 2009 Copa Pernambuco. He scored twice in that cup.[4]

In August 2010 he left for Grêmio Barueri (that season known as Grêmio Prudente)[5]

On 3 January 2011 he left for Paraná Clube in 1-year contract,[6] replacing departed (attacking) midfielder Serginho Catarinense as a member of starting XI.

gollark: Yes, you can use my segfault fixer if that happens.
gollark: Doesn't it just segfault at some point?
gollark: It was more elegance™ to just make it able to do tail-call optimization.
gollark: I actually stole this particular quicksort from a r/haskell post talking about it.
gollark: ```lisp (let (partition_rec xs pred acc) (cond ((= xs '()) acc) (true (partition_rec (tail xs) pred (cond ((pred (head xs)) (list (cons (head xs) (head acc)) (snd acc))) (true (list (head acc) (cons (head xs) (snd acc)))) ))) )) (let (qsort xs cont) (cond ((= xs '()) (cont '())) (true (do (let h (head xs)) (let t (tail xs)) (let part_result (partition_rec t (lambda (x) (< x h)) '(() ()))) (qsort (head part_result) (lambda (ls) (qsort (snd part_result) (lambda (rs) (cont (+ ls (list h) rs)))))) )) ))```These all have to be done tail recursively or it could overflow.

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.