document_title: La Vie en rose

question_text: when did louis armstrong record la vie en rose

text: La Vie en rose

text: Édith Piaf version[edit]

text: Background and release[edit]

text: The song's title can be translated as "Life in happy hues", "Life seen through happy lenses", "Life in rosy hues"; its literal meaning is "Life in Pink".[6]

text: The lyrics and melody of the song were written by Édith Piaf herself, but the melody was said officially to have been composed and registered by Louiguy only, since at the time, due to the stringent registration requirements of SACEM, Piaf did not have the necessary qualifications to be able to copyright her work with SACEM.[7] Piaf offered the song to Marianne Michel, who slightly modified the lyrics, changing "les choses" ("things") for "la vie" ("life"). In 1943, Piaf had performed at a nightclub/bordello called "La Vie en Rose".[8] Initially, Piaf's peers and songwriting team did not think the song would be successful, finding it weaker than the rest of her repertoire. Heeding their advice, the singer put the song aside, only to change her mind the next year. The song was performed live in concert for the first time in 1946. It became a favorite with audiences.[7] "La Vie en rose" was the song that made Piaf internationally famous, with its lyrics telling about the joy of finding true love and appealing to those who had survived the difficult wartime.[9]

text: "La Vie en rose" was released on a 10" single in 1947 by Columbia Records, a division of EMI, with "Un refrain courait dans la rue" making the B-side. It met with a warm reception and sold a million copies in the US.[10] It was the biggest-selling single of 1948 in Italy, and the ninth biggest-selling single in Brazil in 1949.[11] Piaf performed the song in the 1948 French movie Neuf garçons, un cœur. The first of her albums to include "La Vie en rose" was the 10" Chansons parisiennes, released in 1950. The song appeared on most of Piaf's subsequent albums, and on numerous greatest hits compilations. It went on to become her signature song and her trademark hit, sitting with "Milord" and "Non, je ne regrette rien" among her best-known and most recognizable tunes. Encouraged by its success, Piaf wrote 80 more songs in her career.[7]

text: English lyrics were written by Mack David and numerous versions were recorded in the US in 1950. Those that charted were by Tony Martin (reached the No. 9 position in the Billboard charts), Paul Weston (No. 12 position), Bing Crosby (No. 13 position), Edith Piaf (No. 23 position), Ralph Flanagan (No. 27 position) and Victor Young (No. 27 position). Louis Armstrong recorded C'est si bon and La Vie en rose in New York City with Sy Oliver and his Orchestra on June 26, 1950[12] and this reached the No. 28 position in the Billboard charts.[13] Bing Crosby also recorded the song in French in 1953 for his album Le Bing: Song Hits of Paris.

text: The song received a Grammy Hall of Fame Award in 1998.[14]

text: Track listings[edit]

text: 10" Single (1947)

text: Chart performance[edit]

text:
Chart
Peak
position[11]

United States
23

text: References in popular culture[edit]

text: Two films about Piaf named after the song's title have been produced. The first one, a 1998 documentary, used archive footage and interviews with Raquel Bitton, and was narrated by Bebe Neuwirth. The 2007 biographical feature film La Vie en Rose won Marion Cotillard an Academy Award for Best Actress for portraying Piaf in the film from childhood until her death at 47.[15]

text: As music in films[edit]

text:
Stage Fright (1950)
Operation: Rabbit (1952) – instrumental only (uncredited)
Duck! Rabbit, Duck! (1953) – hummed by a mischievous Daffy Duck
By the Light of the Silvery Moon (1953) – instrumental only
Sabrina (1954) – as Sabrina Fairchild's song
Noches de Casablanca (1963) – sung by Sara Montiel
The Cheap Detective (1978) – however, Eileen Brennan's character, Betty DeBoop, doesn't sing the words, and just sings "La la la la la la la en rose"
Bull Durham (1988)
A Foreign Field (1993)
Natural Born Killers (1994)
Prêt-à-Porter (1994) Grace Jones' version
French Kiss (1995)
Sabrina (1995)
Chloé (1996)
A Soldier's Daughter Never Cries (1998)
Summer of Sam (1999)
View from the Top (2003)
Love Me If You Dare (2003)
Something's Gotta Give Deleted Scene (2003)
Piaf starring Raquel Bitton Lionsgate film (2003)
Modigliani (2004)
A World Without Thieves (2004)
Valiant (2005)
Lord of War (2005)
The Yacoubian Building (2006)
La Vie en rose (2007)
Mister Lonely (2007)
Jellyfish (2007)
Fred Claus (2007)
The Bucket List (2007)
The Wackness (2008)
WALL-E (2008)
Map of the Sounds of Tokyo (2009)
X-Men: First Class (2011)
Monte Carlo (2011)
Midnight in Paris (2011)
Madagascar 3: Europe's Most Wanted (2012)
The Hundred-Foot Journey (2014)
The Other Woman (2014)

text: As music in other media[edit]

text:
In the 2006 Egyptian film The Yacoubian Building, chanteuse Christine (Yousra) includes "La Vie en rose" in her repertoire, singing it on at least one occasion for Zaki el Dessouki (Adel Emam).
In the 1954 movie Sabrina this song is mentioned and played many times throughout the movie, including a partial rendition by Audrey Hepburn.
In the season 4 I Love Lucy episode "Hollywood Anniversary", the song is played by a band in the final scene.
Steampunk chanteuse Veronique Chevalier does a parody version – which turns out to be about a battle with slugs.
In the 2003 romantic comedy Something's Gotta Give, the song is played several times during scenes of Paris, and actor Jack Nicholson (Harry Sanborn) sings it during the closing credit roll.
Cristin Milioti performed the song in "How Your Mother Met Me", an episode of How I Met Your Mother.[16][17]
It is used prominently multiple times in BioShock Infinite's DLC BioShock Infinite: Burial at Sea.
Korean drama A Rosy Life's main title song is a Korean version aptly titled "장밋빛 인생" (Revised Romanization jangmitbit insaeng, translated as "rose-colored life"), which is also the original Korean title of the drama.

text: Other mentions[edit]

text:
Raquel Bitton sings Edith Piaf(CD) (2000)
Ian Fleming references the song in his first James Bond novel Casino Royale, when Bond is eating with Vesper Lynd, and again in his fourth novel Diamonds Are Forever, when Bond chooses to skip it on the record player as it has "painful memories".
The Avengers TV series used this song as an episode title. It was played repeatedly in a house in which Emma Peel was held against her will by an enemy agent she had seduced and betrayed by utilizing the song.
Lyrics from the song are quoted in Albert Cohen's 1968 novel Belle du Seigneur (chapter LVI).
La Vie en Rose was the name of a spaceship in Mobile Suit Zeta Gundam and Mobile Suit Gundam ZZ, as well as an episode title of Mobile Suit Gundam 0083: Stardust Memory.
In the 1990s anime Di Gi Charat, the name Rabi~en~Rose is based in "La Vie en rose".
La Vie en rose is mentioned in John Boyne's 2006 novel The Boy in the Striped Pyjamas.
Scottish singer/songwriter KT Tunstall recorded a cover, included as a digital bonus track of her second studio album Drastic Fantastic.
Canadian singer/songwriter Avril Lavigne has a tattoo reading 'La Vie en rose'.
American singer/songwriter Lady Gaga performed 'La Vie en Rose' during her Cheek to Cheek Tour with Tony Bennett in 2015.
American singer/songwriter Madonna performed 'La Vie en Rose' during her Rebel Heart Tour in 2015-2016. The live recording of the performance was released on the album Rebel Heart Tour.
Marina Prior and Mark Vincent covered the song on their album Together in 2016.
Dean Martin covered this song on his album French Style recorded in 1962.
French singer Anne Pigalle has sang La Vie En Rose live since the beginning of her career and all over the world, including Ronnie Scott's and the Café de Paris in London, Silencio club in Paris, Japan, Mexico, Chateau Marmont in LA, Danceteria in NY and a fundraiser for Tin Pan Alley, the film
Filipina actress and singer Zsa Zsa Padilla also did the song from the top-rating teleserye Wildflower.

text: Grace Jones version[edit]

text:
"La Vie en rose"

Single by Grace Jones

from the album Portfolio

B-side

"I Need a Man"
"Tomorrow"
"Send in the Clowns"

Released
October 1977

Format

7"
12"

Genre
Bossa nova

Length
7:27 (album version)
3:35 (single version)

Label
Island

Songwriter(s)

Édith Piaf
Louiguy
Mack David

Producer(s)
Tom Moulton

Grace Jones singles chronology

"Sorry"
(1976)
"La Vie en rose"
(1977)
"Do or Die"
(1978)

"Sorry"
(1976)
"La Vie en rose"
(1977)
"Do or Die"
(1978)

text: Background and release[edit]

text: Jamaican singer Grace Jones covered "La Vie en rose" in 1977 for her debut studio album Portfolio. It was the third and the last single off that album, and at the same time, her first single release on Island Records after having signed with the label.

text: The single version was heavily edited from its original album version being more than seven minutes long to a 3.5-minute track. Jones' fairly radical bossa nova interpretation of Édith Piaf's signature tune became her first international hit single and a staple of her repertoire. It was later performed as part of her 1981 A One Man Show, then the only track from her disco era to be included in the show. In Spain and Mexico the track was billed as "La Vida en rosa" on the 7" single release, although it was not a Spanish version of the song. Jones' recording of "La Vie en rose" was later re-released a number of times in the early 1980s and finally reached #12 in the UK charts when re-released as a double A-side with "Pull Up to the Bumper" in 1985. The single was certified Gold in France and Italy.[18]

text: Grace Jones about the song: "That's a very special song to me. Oh God, I cry every time I sing it. I had quite a few French lovers, so every time I sing it I think about them."[19]

text: It has sold 158,700 copies in France. [20]

text: Music video[edit]

text: This section does not cite any sources. Please help improve this section by adding citations to reliable sources. Unsourced material may be challenged and removed. (February 2016) (Learn how and when to remove this template message)

text: The music video for the song was made using the chroma key technique. It presents Grace dancing and singing the song with the famous 1978 montage picture of herself in the background, which was later used for the cover of her 1985 Island Life compilation. The video begins with Grace wearing a rose-patterned coat. Having removed it, the singer dances in a scant gold dress which reveals her right nipple as well as black underwear.

text: Track listings[edit]

text: 7" single (1977)

text: 7" Italian single (1977)

text: 7" promotional single (1977)

text: 12" Mexican single (1984)

text: Chart performance[edit]

text:
Chart
Peak
position

Canada[21]
87

Canada (Dance/Urban)[22]
28

France[23]
3

Italy[24]
3

Netherlands[25]
4

Spain[26]
20

text: Donna Summer version[edit]

text:
"La Vie en rose"

Single by Donna Summer

from the album Tribute to Edith Piaf

Released
1993

Format
12", CD

Recorded
1993

Genre
R&B

Length
4:58

Label
AB Disques

Songwriter(s)
Édith Piaf, Louigny, Mack David

Producer(s)
Jacques Arnoul

Donna Summer singles chronology

"Carry On"
(1992)
"La Vie en rose"
(1993)
"Melody of Love (Wanna Be Loved)"
(1994)

"Carry On"
(1992)
"La Vie en rose"
(1993)
"Melody of Love (Wanna Be Loved)"
(1994)

text: Background and release[edit]

text: American singer Donna Summer covered "La Vie en rose" in 1993 for the tribute album called Tribute to Edith Piaf or Edith Piaf Tribute, on which several contemporary stars recorded interpretations of some of Piaf's best known songs. Released on both vinyl and CD, the American release of the album and single contain a different mix of Summer's synth-driven performance than the French release. These releases are among the most sought after of Summer's collectables.[citation needed] The U.S. single features a variety of remixes by DJ Chris Cox.

text: Track listings[edit]

text: 12" Single

text: 12" Maxi-Single

text: 12" Promotional Single

text: CD Single

text:
"La Vie en rose" (US Radio Mix) – 3:43
"La Vie en rose" (Full Bass Mix) – 4:25
"La Vie en rose" (Extended Soul Mix) – 7:40
"La Vie en rose" (Stringapella Mix) – 5:43

tag: ol


document_title: Samantha Jones (Sex and the City)

question_text: when does samantha get cancer in sex and the city

root

text: Samantha Jones (Sex and the City)

text: Character history[edit]

text: Samantha Jones, is one of four single friends portrayed in the series, a public relations worker who is a proud, confident, highly sexual woman. Most of her story lines revolve around the frequent sex and brief affairs she has. She is outspoken and a self-proclaimed "try-sexual" (meaning she'll try anything at least once). She is portrayed as brash, straightforward, highly protective of her friends and unafraid of confrontation. She also displays nonchalance toward dating and monogamy and becomes uncomfortable whenever her sexual relationships take an emotional turn.

tag: p

text: Not much is known about Samantha's younger years. It is known that she came from a working class background, and she spent most of her teenage years selling Dilly bars at Dairy Queen to earn pocket money. Season 3 implies that she has at least two siblings, when she mentions that at her age, her mother "was saddled with three kids and a drunk husband". In the second episode of the second season of The Carrie Diaries, she said that she came from the Everglades, and that she used to have alligator overturned by car for breakfast. She later mentions partying at Studio 54 during its heyday, implying she moved sometime in the mid- to late-1970s from wherever she grew up to New York City. She has mentioned having had at least two abortions, one of which occurred while she was in college.

text: Samantha is the eldest of the four friends (in the final scene of the Sex and the City film, her 50th birthday is celebrated), though it is implied during the early seasons that the other three are not aware of how much older Samantha is than they are. She has her own public-relations company. In the book's prequel series, it is revealed that Carrie met Samantha first.

text: In the early part of the series, she lives on the Upper East Side, but ends up moving to an expensive apartment in the Meatpacking District. The move is provoked after one of her late-night visitors lets in a mugger who attacks one of her older female neighbors and Samantha incurs the wrath of a tribelike commune of her elderly neighbors.

text: One of Samantha's best qualities is her loyalty to her friends. When Carrie confesses to her that she's having an affair with her married ex-boyfriend "Mr. Big," and is cheating on her boyfriend, Aidan, Samantha tells her that judging is not her style and offers her support. Although she fights with Charlotte a few times, they always manage to get past their differences and make up. Despite having trouble adjusting to Miranda having a child, she willingly gives up a coveted hair appointment with a distinguished hairdresser and sends Miranda in her place, staying behind to babysit and give her friend a much-needed break. Although Miranda is usually considered Carrie's best friend, Samantha is shown to be closer with Carrie on several occasions; such as when Carrie hates an engagement ring that Miranda picks out for Aidan to give to Carrie, but loves the replacement ring selected with Samantha's help.

text: In the show's last season, Samantha is diagnosed with breast cancer. She faces the challenge head-on, playing with her look by wearing outrageous wigs, hats, and headscarves after she loses her hair to chemotherapy. In one of the final episodes, she gives a speech for a cancer benefit dinner, and receives a standing ovation for removing her wig onstage and admitting that she was suffering with hot flashes. The audience appreciated her candor and honesty, and many of the women in the audience stood up and removed their own wigs.

text: Sex and the City: The Movie[edit]

text: Four years later, Samantha has moved to Los Angeles with Smith to further his acting career; he's now playing a doctor on a popular daytime drama. Samantha, who visits New York City as much as possible, finds herself attracted to a hunky exhibitionist neighbor, Dante, whom she regularly sees nude when he takes a shower or has sex with various women. Dante's escapades reminds Samantha of her sexually free past and he could be considered the male version of Samantha. While she remains faithful to Smith, she finds herself questioning whether or not her strained relationship with him should be continued as she simultaneously uses food as an outlet for her sexual desires for Dante, flagrantly gaining weight in the later stages of the movie. Samantha claims 'I eat, so I won't cheat'. Samantha, realizing her true unhappiness, breaks up with Smith. Samantha seemingly returns to reside New York City. Our last view of Samantha is her celebrating her 50th birthday in Manhattan and toasting to the next fifty with Carrie, Miranda and Charlotte.

text: Sex and the City 2[edit]

text: Samantha is approached by an Arab sheikh to devise a PR campaign for his business, and he flies her and her friends on an all-expenses-paid luxury vacation to Abu Dhabi. When the girls are picnicking they meet an architect named Rikard Spirt (Max Ryan). Meeting him later that evening out with the girls addressing him as "Dick Spurt" and graciously declines his offer for a drink because of her devotion to her friends' "girls night out" but agrees to meet the next evening. While on that date Samantha is detained for having sex on the beach. With the Sheik's intervention Samantha is released, leaving her with a permanent police record. The PR meeting is cancelled, and their luxurious perks are no longer paid for. They quickly pack their bags and attempt to leave but have to retrieve Carrie's passport that she unknowingly left at the souk. Due to a mix-up the men there believe Samantha has stolen a bag. They confront her and Samantha's real bag rips open in the middle of a bustling souk and the contents, including strips of condoms falls out. Disgusted Muslim men crowd around and Samantha brashly responds that what they were viewing were indeed condoms and that she 'has sex'. Samantha has to be pulled away by her fearful friends. They are helped by impressed Muslim women in traditional wear, who let them into their home and reveal that they're wearing Louis Vuitton collection underneath. The Muslim women aid the girls in escaping the souk by giving them full-body niqabs to cover their identity. They leave Abu Dhabi and return to the New York City in the USA. At the end of the movie Samantha has sex with Rikhard in "the land of the free and home of the hormones", at an East Hampton sand dune.

text: The Carrie Diaries[edit]

text: In the second season of the prequel series, Samantha is introduced as Carrie's enemy Donna Ladonna's cousin and is portrayed by Lindsey Gort.

text: Relationships[edit]

text: Samantha's main love is men—many of them.[6][7] Over the course of the series, she sleeps with plenty of interesting characters, including a man who will only "swing" with her if she takes an HIV test, a college student from the Midwest with the same name (Sam Jones) who is eager to lose his virginity, a guy with "funky spunk", and a trainer from her gym who brands her by shaving her pubic hair into a lightning bolt. She never lets the men stay for long, usually requiring them to leave "an hour after [she] climaxes." One of her sexual antics includes making a sex-tape to disprove tabloids' claims that she is a fag hag. She once said that she frequently loses underwear because she leaves them at the guys' places and never returns. She even slept with her good friend Charlotte's brother, prompting an angry Charlotte to call Samantha's vagina "the hottest spot in town: it's always open."

text: Samantha rarely dates men more than once or twice. She does have a few "serious" relationships throughout the run of the series.

text: James[edit]

text: Samantha meets a man named James (James Goodwin) in a jazz bar at the end of season one. Unusually for Samantha, she doesn't have sex with him immediately, taking a leaf instead from Charlotte's book, because she felt he was a man she would marry. After declaring that she was in love with him, the two finally have sex, only for Samantha to discover that James was seriously under-endowed, to the point where she could not enjoy sex. In the last episode of season one, ("Oh Come All Ye Faithful") she tells Carrie, Charlotte, and Miranda that he is only three inches long when hard, and that she doesn't even receive any pleasure out of giving him a blowjob because his penis is so small. Though she tries to work through it, she eventually ends things with him when they attend a couples' counseling session. She confesses she is unable to feel someone as small as a baby carrot, to which he replies angrily by saying that maybe her vagina is too big.

text: In a funny counterpoint to her predicament with James, in the second-season episode "Ex and the City," Samantha meets Mr. Too Big, who warns her of his huge endowment as he undresses. Samantha squeals with delight as the story segues to another character. Later in the episode, when Samantha reappears, she is slowly guiding Mr. Too Big between her legs. After much hesitation, she seems to finally relax while drawing him in (she thinks), only to be asked if he can start. A shocked and fearful Samantha pushes him away with her foot on his chest and begs off the encounter. At the end of this episode she unexpectedly yells "I miss James!" while her friends goofishly sing "The Way We Were" in a crowded restaurant - the exclamation is tearful, suggesting that her feelings for James may have been legitimate.

text: Maria[edit]

text: In season four, Samantha flirts with lesbianism, entering into a brief but serious relationship with an artist named Maria (Sônia Braga). The girls are completely shocked by this, more so that she is in a relationship than the fact that it's with a woman. Charlotte proclaims, "She's not a lesbian, she probably just ran out of men!". Samantha feels she is not a relationship person, and she initially only wants to be friends with Maria. Maria tells Samantha she cannot continue being just friends with her, and Samantha decides to take a chance and kisses Maria. Samantha seems intrigued about learning the act of pleasing another woman, thus learning more about her own sexuality. Once the sex begins to dwindle and they spend a lot of time talking, Samantha begins to tire of their relationship. Maria also becomes upset when Samantha's sexual past catches up with them. Samantha ultimately misses men too much and, although Maria decides to try strap-on dildos, the two break up due to Maria's belief that Samantha has "intimacy issues."

text: Richard Wright[edit]

text: Later in season four, Samantha meets and falls in love with hotel magnate Richard Wright (James Remar). Though the two seemed well-matched, as they are both confident, highly successful, and like sleeping around and are uninterested in relationships, Samantha finds herself becoming increasingly attached to Richard. The two eventually commit to a monogamous relationship. However, Samantha is heart broken when she catches him cheating on her. Despite giving Richard a second chance, she decides to end the relationship when she realizes she doesn't trust him. In the last season, she runs into Richard while out at a party with her new boyfriend, Smith, and Samantha and Richard go upstairs to have sex. During intercourse, Samantha is seen looking uninterested and pained at being with Richard. Smith waits for her downstairs, knowing what she has done, and she breaks down in his arms, apologizing to him.

text: Jerry Jerrod/Smith Jerrod[edit]

text: Samantha sees a 28-year-old waiter/aspiring actor (Jason Lewis) while dining with the girls at a new, hip restaurant called "Raw." She later returns to the restaurant alone, with the sole mission of taking him home; she succeeds, outlasting numerous other women who are there for the same purpose. At first it seems he is to be just another notch on her bedpost, and she doesn't even know his name, referring to him as "Smith" to her Jones in elaborate sexual scenarios they enact. They have adventurous, "out-of-the-box" sex, which Samantha finds exciting and refreshing. She is turned off by learning anything personal about him, such as that he is a recovering alcoholic. But she finds she is enjoying her time with him so much that she keeps seeing him.

text: Seeing that he is broke and struggling, Samantha uses her PR skills to jump-start Jerry's modeling and acting career, and, once she learns his birth name (Jerry Jerrod), changes it to Smith Jerrod. Samantha likes that he is not intimidated by her success (in contrast to Carrie's ex-boyfriend, Jack Berger), and with her assistance, he quickly becomes a celebrity. He first gains attention when he models naked in an Absolut Vodka ad in Times Square, in which he appears as the "Absolut Hunk."[8] This publicity leads to a role in a Gus Van Sant film.

text: Reluctant at first to admit she cares about him, Samantha misses him while he is on location. Smith returns from his film and shows her true affection, which Samantha finds unsettling. (As she explains to Carrie, he tried to do something purely perverse to her in public: "He tried to hold my hand.") Samantha struggles with Smith's status as a teen icon and their age difference. She ends up deliberately humiliating him by hooking up with her ex-flame Richard at a party she went to with Smith. After a quick bout of clearly meaningless sex with Richard, during which he talks about himself, Samantha seeks out Smith, who has been waiting for her to realize she made a mistake and come back. She tearfully confesses that she hates what she just did to him. Eventually, she begins referring to Smith as her boyfriend. It appears that the two live together, since Smith refers to her place as "home," and he has keys to the apartment.

text: Smith supports Samantha through her brush with cancer, even shaving his hair when her hair began falling out, and then shaving hers. Samantha has no sexual libido during chemotherapy and encourages Smith to have sex with anyone he wants while he is in Canada filming his next movie. Smith refuses, comparing her situation to winter: "just because the trees are bare doesn't mean they're dead." While he is away, he sends her unbloomed flowers with a message on the card reading "Looking forward to spring." She calls him to tell him she changed her mind about Smith having sex with other women, and Smith happily complies. Smith returns to New York in the middle of the night, flying back after their phone call to say that he loves her. Samantha replies that he "means more to [her] than any man [she's] ever known," which, for Samantha, is a huge statement. Their last scene together in the TV series shows the two having sex and Samantha enjoying herself; the previously unbloomed flowers have now begun to open.

text: Four years later, the pair are still together, with Samantha giving up her job and home to live in Los Angeles with him and be his publicist supporting his booming acting career. But Samantha has become restless with monogamy and resents that Smith's career has taken over her life. After a struggle with her weight and self-control, Samantha eventually decides to end their relationship. She explains that she loves being single more than any relationship. As seen in the Sex and the City 2 movie, the two remain friends, with Smith even inviting her to be his date to the premiere of his summer blockbuster, and introduces him to the film's Arab financier, who invites Samantha to visit his resort in Abu Dhabi so she can plan an advertising campaign for him.


question_text: british heavyweight boxer a european champion in the 1960's

question_tokens: british heavyweight boxer a european champion in the 1960 's

text: List of British heavyweight boxing champions is a table showing the boxers who have won the British heavyweight championship, which has been sanctioned by the National Sporting Club since 1891, and the British Boxing Board of Control since 1929.

text: A champion will often voluntarily relinquish the title in order to fight for a higher-ranked championship, such as the world or European. Where the date on which a champion relinquished the title is unclear, the date of his final defence is shown.

text:
r – Champion relinquished title.
s – Champion stripped of title.

text:
Name

Duration of reign

Defences

Jack Palmer

18 December 1905 – 29 October 1906

1

Gunner Moir

29 October 1906 – 19 April 1909

2

William Hague

19 April 1909 – 24 April 1911

3

Bombardier Billy Wells

24 April 1911 – 27 February 1919

14

Joe Beckett

27 February 1919s

0

Frank Goddard

26 May 1919 – 17 June 1919

1

Joe Beckett

17 June 1919 – 14 May 1923r

4

Frank Goddard

21 November 1923 – 18 March 1926

2

Phil Scott

18 March 1926 – 30 April 1926r

1

Reggie Meen

16 November 1931 – 12 July 1932

1

Jack Petersen

12 July 1932 – 30 November 1933

3

Len Harvey

30 November 1933 – 4 June 1934

1

Jack Petersen

4 June 1934 – 17 August 1936

4

Ben Foord

17 August 1936 – 15 March 1937

1

Tommy Farr

15 March 1937r

0

Len Harvey

1 December 1938r

0

Jack London

15 September 1944 – 17 July 1945

1

Bruce Woodcock

17 July 1945 – 14 November 1950

2

Jack Gardner

14 November 1950 – 11 March 1952

1

Johnny Williams

11 March 1952 – 12 May 1953

1

Don Cockell

12 May 1953r

0

Joe Erskine

27 August 1956 – 3 June 1958

2

Brian London

3 June 1958 – 12 January 1959

1

Henry Cooper

12 January 1959 – 7 November 1967r

8

Jack Bodell

13 October 1969 – 24 March 1970

1

Henry Cooper

24 March 1970 – 16 March 1971

1

Joe Bugner

16 March 1971 – 27 September 1971

1

Jack Bodell

27 September 1971 – 27 June 1972

1

Danny McAlinden

27 June 1972 – 13 January 1975

1

Bunny Johnson

13 January 1975 – 30 September 1975

1

Richard Dunn

30 September 1975 – 12 October 1976

2

Joe Bugner

12 October 1976r

0

John L. Gardner

24 October 1978 – 26 June 1979r

1

Gordon Ferris

30 March 1981 – 12 October 1981

1

Neville Meade

12 October 1981 – 22 September 1983

1

David Pearce

22 September 1983r

0

Hughroy Currie

18 September 1985 – 12 April 1986

1

Horace Notice

12 April 1986 – 9 March 1988r

3

Gary Mason

18 January 1989 – 6 March 1991

2

Lennox Lewis

6 March 1991 – 30 April 1992r

2

Herbie Hide

27 February 1993r

0

James Oyebola

19 November 1994 – 27 October 1995

1

Scott Welch

27 October 1995r

0

Julius Francis

27 September 1997 – 13 March 2000

4

Michael Holden

13 March 2000r

0

Danny Williams

21 October 2000 – 24 January 2004

5

Michael Sprott

24 January 2004 – 24 April 2004

1

Matt Skelton

24 April 2004 – 10 December 2005r

3

Scott Gammer

16 June 2006 – 2 March 2007

2

Danny Williams

2 March 2007 – 15 May 2010

3

Dereck Chisora

15 May 2010 – 23 July 2011

1

Tyson Fury

23 July 2011 – 8 February 2012r

0

David Price

19 May 2012 – 5 December 2013r

0

Tyson Fury

30 November 2014 - 28 November 2015r

0

Anthony Joshua

12 December 2015 - 9 April 2016r

0

Dillian Whyte

7 October 2016 – 12 January 2017r

0

Sam Sexton

6 October 2017 – 12 May 2018

0

Hughie Fury

12 May 2018 - present

0

tag: table


document_title: Binary search algorithm

question_text: binary search is most suitable for what kind of data list

text: Binary search algorithm

text: Algorithm[edit]

text: Binary search works on sorted arrays. Binary search begins by comparing the middle element of the array with the target value. If the target value matches the middle element, its position in the array is returned. If the target value is less than the middle element, the search continues in the lower half of the array. If the target value is greater than the middle element, the search continues in the upper half of the array. By doing this, the algorithm eliminates the half in which the target value cannot lie in each iteration.[7]

text: Procedure[edit]

text: Given an array A of n elements with values or records A0, A1, ..., An−1, sorted such that A0 ≤ A1 ≤ ... ≤ An−1, and target value T, the following subroutine uses binary search to find the index of T in A.[7]

text:
Set L to 0 and R to n − 1.
If L > R, the search terminates as unsuccessful.
Set m (the position of the middle element) to the floor of (L + R) / 2, which is the greatest integer less than or equal to (L + R) / 2.
If Am < T, set L to m + 1 and go to step 2.
If Am > T, set R to m − 1 and go to step 2.
Now Am = T, the search is done; return m.

text: This iterative procedure keeps track of the search boundaries with the two variables L and R. The procedure may be expressed in pseudocode as follows, where the variable names and types remain the same as above, floor is the floor function, and unsuccessful refers to a specific variable that conveys the failure of the search.[7]

text: Alternative procedure[edit]

text: In the above procedure, the algorithm checks whether the middle element (m) is equal to the target (T) in every iteration. Some implementations leave out this check during each iteration. The algorithm would perform this check only when one element is left (when L = R). This results in a faster comparison loop, as one comparison is eliminated per iteration. However, it requires one more iteration on average.[8]

text: Hermann Bottenbruch published the first implementation to leave out this check in 1962.[8][9]

text:
Set L to 0 and R to n − 1.
If L = R, go to step 6.
Set m (the position of the middle element) to the  ceiling of (L + R) / 2, which is the least integer greater than or equal to (L + R) / 2..
If Am > T, set R to m − 1 and go to step 2.
Set L to m and go to step 2.
Now L = R, the search is done. If AL = T, return L. Otherwise, the search terminates as unsuccessful.

text: Duplicate elements[edit]

text: The procedure may return any index whose element is equal to the target value, even if there are duplicate elements in the array. For example, if the array to be searched was [1, 2, 3, 4, 4, 5, 6, 7] and the target was 4, then it would be correct for the algorithm to either return the 4th (index 3) or 5th (index 4) element. The regular procedure would return the 4th element (index 3). However, it is sometimes necessary to find the leftmost element or the rightmost element if the target value is duplicated in the array. In the above example, the 4th element is the leftmost element of the value 4, while the 5th element is the rightmost element of the value 4. The alternative procedure above will always return the index of the rightmost element if an element is duplicated in the array.[9]

text: Procedure for finding the leftmost element[edit]

text: To find the leftmost element, the following procedure can be used:[10]

text:
Set L to 0 and R to n.
If L ≥ R, go to step 6.
Set m (the position of the middle element) to the floor of (L + R) / 2, which is the greatest integer less than or equal to (L + R) / 2
If Am < T, set L to m + 1 and go to step 2.
Otherwise, if Am ≥ T, set R to m and go to step 2.
Now L = R, the search is done, return L.

text: If L < n and AL = T, then AL is the leftmost element that equals T. Even if T is not in the array, L is the rank of T in the array, or the number of elements in the array that are less than T.

text: Where floor is the floor function, the pseudocode for this version is:

text: Procedure for finding the rightmost element[edit]

text: To find the rightmost element, the following procedure can be used:[10]

text:
Set L to 0 and R to n.
If L ≥ R, go to step 6.
Set m (the position of the middle element) to the floor of (L + R) / 2, which is the greatest integer less than or equal to (L + R) / 2.
If Am > T, set R to m and go to step 2.
Otherwise, if Am ≤ T, set L to m + 1 and go to step 2.
Now L = R, the search is done, return L - 1.

text: If L > 0 and AL - 1 = T, then AL - 1 is the rightmost element that equals T. Even if T is not in the array, (n - 1) - L is the number of elements in the array that are greater than T.

text: Approximate matches[edit]

text: The above procedure only performs exact matches, finding the position of a target value. However, it is trivial to extend binary search to perform approximate matches because binary search operates on sorted arrays. For example, binary search can be used to compute, for a given value, its rank (the number of smaller elements), predecessor (next-smallest element), successor (next-largest element), and nearest neighbor. Range queries seeking the number of elements between two values can be performed with two rank queries.[11]

text:
Rank queries can be performed with the procedure for finding the leftmost element. The  number of elements less than the target value is returned by the procedure.[11]
Predecessor queries can be performed with rank queries. If the rank of the target value is r, its predecessor is r − 1.[12]
For successor queries, the procedure for finding the rightmost element can be used. If the result of running the procedure for the target value is r, then the successor of the target value is r + 1.[12]
The nearest neighbor of the target value is either its predecessor or successor, whichever is closer.
Range queries are also straightforward.[12] Once the ranks of the two values are known, the number of elements greater than or equal to the first value and less than the second is the difference of the two ranks. This count can be adjusted up or down by one according to whether the endpoints of the range should be considered to be part of the range and whether the array contains keys matching those endpoints.[13]

tag: ul

text: Performance[edit]

text: The performance of binary search can be analyzed by reducing the procedure to a binary comparison tree. The root node of the tree is the middle element of the array. The middle element of the lower half is the left child node of the root and the middle element of the upper half is the right child node of the root. The rest of the tree is built in a similar fashion. This model represents binary search. Starting from the root node, the left or right subtrees are traversed depending on whether the target value is less or more than the node under consideration. This represents the successive elimination of elements.[6][14]

text:
In the worst case, binary search makes

⌊

log

2

(
n
)
+
1
⌋

{\textstyle \lfloor \log _{2}(n)+1\rfloor }

 iterations of the comparison loop, where the

⌊
⌋

{\textstyle \lfloor \rfloor }

 notation denotes the floor function that rounds its argument to the next-smallest integer and

log

2

{\textstyle \log _{2}}

 is the binary logarithm. The worst case is reached when the search reaches the deepest level of the tree. This is equivalent to a binary search that has reduced to one element and always eliminates the smaller subarray out of the two in each iteration if they are not of equal size.[a][14]

text:
The worst case may also be reached when the target element is not in the array. If

n

{\textstyle n}

 is one less than a power of two, then this is always the case. Otherwise, the search may perform

⌊

log

2

(
n
)
+
1
⌋

{\textstyle \lfloor \log _{2}(n)+1\rfloor }

iterations if the search reaches the deepest level of the tree. However, it may make

⌊

log

2

(
n
)
⌋

{\textstyle \lfloor \log _{2}(n)\rfloor }

 iterations, which is one less than the worst case, if the search ends at the second-deepest level of the tree.[15]

text:
On average, assuming that each element is equally likely to be searched, binary search makes

⌊

log

2

(
n
)
⌋
+
1
−
(

2

⌊

log

2

(
n
)
⌋

−

log

2

(
n
)
−
2
)

/

n

{\displaystyle \lfloor \log _{2}(n)\rfloor +1-(2^{\lfloor \log _{2}(n)\rfloor }-\log _{2}(n)-2)/n}

 iterations when the target element is in the array. This is approximately equal to

log

2

(
n
)
−
1

{\displaystyle \log _{2}(n)-1}

 iterations. When the target element is not in the array, binary search makes

⌊

log

2

(
n
)
⌋
+
2
−

2

⌊

log

2

(
n
)
⌋
+
1

/

(
n
+
1
)

{\displaystyle \lfloor \log _{2}(n)\rfloor +2-2^{\lfloor \log _{2}(n)\rfloor +1}/(n+1)}

 iterations on average, assuming that the range between and outside elements is equally likely to be searched.[14]

text: In the best case, where the target value is the middle element of the array, its position is returned after one iteration.[16]

text: In terms of iterations, no search algorithm that works only by comparing elements can exhibit better average and worst-case performance than binary search. The comparison tree representing binary search has the fewest levels possible as every level above the lowest level of the tree is filled completely.[b] Otherwise, the search algorithm can eliminate few elements in an iteration, increasing the number of iterations required in the average and worst case. This is the case for other search algorithms based on comparisons, as while they may work faster on some target values, the average performance over all elements is worse than binary search. By dividing the array in half, binary search ensures that the size of both subarrays are as similar as possible.[14]

text: Performance of alternative procedure[edit]

text:
Each iteration of the binary search procedure defined above makes one or two comparisons, checking if the middle element is equal to the target in each iteration. Assuming that each element is equally likely to be searched, each iteration makes 1.5 comparisons on average. A variation of the algorithm checks whether the middle element is equal to the target at the end of the search. On average, this eliminates half a comparison from each iteration. This slightly cuts the time taken per iteration on most computers. However, it guarantees that the search takes the maximum number of iterations, on average adding one iteration to the search. Because the comparison loop is performed only

⌊

log

2

(
n
)
+
1
⌋

{\textstyle \lfloor \log _{2}(n)+1\rfloor }

 times in the worst case, the slight increase in efficiency per iteration does not compensate for the extra iteration for all but enormous

n

{\textstyle n}

.[c][17][18]

text: Binary search versus other schemes[edit]

text:
Sorted arrays with binary search are a very inefficient solution when insertion and deletion operations are interleaved with retrieval, taking

O
(
n
)

{\textstyle O(n)}

 time for each such operation. In addition, sorted arrays can complicate memory use especially when elements are often inserted into the array.[19] There are other data structures that support much more efficient insertion and deletion. Binary search can be used to perform exact matching and set membership (determining whether a target value is in a collection of values). There are data structures that support faster exact matching and set membership. However, unlike many other searching schemes, binary search can be used for efficient approximate matching, usually performing such matches in

O
(
log

n
)

{\textstyle O(\log n)}

 time regardless of the type or structure of the values themselves.[20] In addition, there are some operations, like finding the smallest and largest element, that can be performed efficiently on a sorted array.[11]

text: Hashing[edit]

text: For implementing associative arrays, hash tables, a data structure that maps keys to records using a hash function, are generally faster than binary search on a sorted array of records.[21] Most hash table implementations require only amortized constant time on average.[d][23] However, hashing is not useful for approximate matches, such as computing the next-smallest, next-largest, and nearest key, as the only information given on a failed search is that the target is not present in any record.[24] Binary search is ideal for such matches, performing them in logarithmic time. Binary search also supports approximate matches. Some operations, like finding the smallest and largest element, can be done efficiently on sorted arrays but not on hash tables.[20]

text: Trees[edit]

text: A binary search tree is a binary tree data structure that works based on the principle of binary search. The records of the tree are arranged in sorted order, and each record in the tree can be searched using an algorithm similar to binary search, taking on average logarithmic time. Insertion and deletion also require on average logarithmic time in binary search trees. This can be faster than the linear time insertion and deletion of sorted arrays, and binary trees retain the ability to perform all the operations possible on a sorted array, including range and approximate queries.[20][25]

text:
However, binary search is usually more efficient for searching as binary search trees will most likely be imperfectly balanced, resulting in slightly worse performance than binary search. This even applies to balanced binary search trees, binary search trees that balance their own nodes, because they rarely produce optimally-balanced trees. Although unlikely, the tree may be severely imbalanced with few internal nodes with two children, resulting in the average and worst-case search time approaching

n

{\textstyle n}

 comparisons.[e] Binary search trees take more space than sorted arrays.[27]

text: Binary search trees lend themselves to fast searching in external memory stored in hard disks, as binary search trees can efficiently be structured in filesystems. The B-tree generalizes this method of tree organization. B-trees are frequently used to organize long-term storage such as databases and filesystems.[28][29]

text: Linear search[edit]

text:
Linear search is a simple search algorithm that checks every record until it finds the target value. Linear search can be done on a linked list, which allows for faster insertion and deletion than an array. Binary search is faster than linear search for sorted arrays except if the array is short, although the array needs to be sorted beforehand.[f][31] All sorting algorithms based on comparing elements, such as quicksort and merge sort, require at least

O
(
n
log

n
)

{\textstyle O(n\log n)}

 comparisons in the worst case.[32] Unlike linear search, binary search can be used for efficient approximate matching. There are operations such as finding the smallest and largest element that can be done efficiently on a sorted array but not on an unsorted array.[33]

text: Set membership algorithms[edit]

text:
A related problem to search is set membership. Any algorithm that does lookup, like binary search, can also be used for set membership. There are other algorithms that are more specifically suited for set membership. A bit array is the simplest, useful when the range of keys is limited. It compactly stores a collection of bits, with each bit representing a single key within the range of keys. Bit arrays are very fast, requiring only

O
(
1
)

{\textstyle O(1)}

 time.[34]  The Judy1 type of Judy array handles 64-bit keys efficiently.[35]

text:
For approximate results, Bloom filters, another probabilistic data structure based on hashing, store a set of keys by encoding the keys using a bit array and multiple hash functions. Bloom filters are much more space-efficient than bit arrays in most cases and not much slower: with

k

{\textstyle k}

 hash functions, membership queries require only

O
(
k
)

{\textstyle O(k)}

 time. However, Bloom filters suffer from false positives.[g][h][37]

text: Other data structures[edit]

text: There exist data structures that may improve on binary search in some cases for both searching and other operations available for sorted arrays. For example, searches, approximate matches, and the operations available to sorted arrays can be performed more efficiently than binary search on specialized data structures such as van Emde Boas trees, fusion trees, tries, and bit arrays. These specialized data structures are usually only faster because they take advantage of the properties of keys with a certain attribute (usually keys that are small integers), and thus will be time or space consuming for keys that lack that attribute.[20] As long as the keys can be ordered, these operations can always be done at least efficiently on a sorted array regardless of the keys. Some structures, such as Judy arrays, use a combination of approaches to mitigate this while retaining efficiency and the ability to perform approximate matching.[35]

text: Variations[edit]

text: Uniform binary search[edit]

text: Uniform binary search stores, instead of the lower and upper bounds, the index of the middle element and the change in the middle element from the current iteration to the next iteration. Each step reduces the change by about half. For example, if the array to be searched is [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11], the middle element would be 6. Uniform binary search works on the basis that the difference between the index of middle element of the array and the left and right subarrays is the same. In this case, the middle element of the left subarray ([1, 2, 3, 4, 5]) is 3 and the middle element of the right subarray ([7, 8, 9, 10, 11]) is 9. Uniform binary search would store the value of 3 as both indices differ from 6 by this same amount.[38] To reduce the search space, the algorithm either adds or subtracts this change from the middle element. The main advantage of uniform binary search is that the procedure can store a table of the differences between indices for each iteration of the procedure. Uniform binary search may be faster on systems where it is inefficient to calculate the midpoint, such as on decimal computers.[39]

text: Exponential search[edit]

text:
Exponential search extends binary search to unbounded lists. It starts by finding the first element with an index that is both a power of two and greater than the target value. Afterwards, it sets that index as the upper bound, and switches to binary search. A search takes

⌊

log

2

x
+
1
⌋

{\textstyle \lfloor \log _{2}x+1\rfloor }

 iterations of the exponential search and at most

⌊

log

2

x
⌋

{\textstyle \lfloor \log _{2}x\rfloor }

 iterations of the binary search, where

x

{\textstyle x}

 is the position of the target value. Exponential search works on bounded lists, but becomes an improvement over binary search only if the target value lies near the beginning of the array.[40]

text: Interpolation search[edit]

text:
Instead of calculating the midpoint, interpolation search estimates the position of the target value, taking into account the lowest and highest elements in the array as well as length of the array. This is only possible if the array elements are numbers. It works on the basis that the midpoint is not the best guess in many cases. For example, if the target value is close to the highest element in the array, it is likely to be located near the end of the array.[41] When the distribution of the array elements is uniform or near uniform, it makes

O
(
log

log

n
)

{\textstyle O(\log \log n)}

 comparisons.[41][42][43]

text: In practice, interpolation search is slower than binary search for small arrays, as interpolation search requires extra computation. Its time complexity grows more slowly than binary search, but this only compensates for the extra computation for large arrays.[41]

text: Fractional cascading[edit]

text:
Fractional cascading is a technique that speeds up binary searches for the same element in multiple sorted arrays. Searching each array separately requires

O
(
k
log

n
)

{\textstyle O(k\log n)}

 time, where

k

{\textstyle k}

 is the number of arrays. Fractional cascading reduces this to

O
(
k
+
log

n
)

{\textstyle O(k+\log n)}

 by storing specific information in each array about each element and its position in the other arrays.[44][45]

text: Fractional cascading was originally developed to efficiently solve various computational geometry problems. Fractional cascading has been applied elsewhere, such as in data mining and Internet Protocol routing.[44]

text: Noisy binary search[edit]

text: Noisy binary search algorithms solve the case where the algorithm cannot reliably compare elements of the array. For each pair of elements, there is a certain probability that the algorithm makes the wrong comparison. Noisy binary search can find the correct position of the target with a given probability that controls the reliability of the yielded position.[i][j][49][50]

text: Quantum binary search[edit]

text:
Classical computers are bounded to the worst case of exactly

⌊

log

2

n
+
1
⌋

{\textstyle \lfloor \log _{2}n+1\rfloor }

 iterations when performing binary search. Quantum algorithms for binary search are still bounded to a proportion of

log

2

n

{\textstyle \log _{2}n}

 queries (representing iterations of the classical procedure), but the constant factor is less than one, providing for faster performance on quantum computers. Any exact quantum binary search procedure—that is, a procedure that always yields the correct result—requires at least

1
π

(
ln

n
−
1
)
≈
0.220

log

2

n

{\textstyle {\frac {1}{\pi }}(\ln n-1)\approx 0.220\log _{2}n}

 queries in the worst case, where

ln

{\textstyle \ln }

 is the natural logarithm.[51] There is an exact quantum binary search procedure that runs in

4

log

605

n
≈
0.433

log

2

n

{\textstyle 4\log _{605}n\approx 0.433\log _{2}n}

 queries in the worst case.[52] In comparison, Grover's algorithm is the optimal quantum algorithm for searching an unordered list of elements, and it requires

O
(

n

)

{\displaystyle O({\sqrt {n}})}

 queries.[53]

text: History[edit]

text: In 1946, John Mauchly made the first mention of binary search as part of the Moore School Lectures, a seminal and foundational college course in computing.[9] In 1957, William Wesley Peterson published the first method for interpolation search.[9][54] Every published binary search algorithm worked only for arrays whose length is one less than a power of two[k] until 1960, when Derrick Henry Lehmer published a binary search algorithm that worked on all arrays.[56] In 1962, Hermann Bottenbruch presented an ALGOL 60 implementation of binary search that placed the comparison for equality at the end, increasing the average number of iterations by one, but reducing to one the number of comparisons per iteration.[8] The uniform binary search was developed by A. K. Chandra of Stanford University in 1971.[9] In 1986, Bernard Chazelle and Leonidas J. Guibas introduced fractional cascading as a method to solve numerous search problems in computational geometry.[44][57][58]

text: Implementation issues[edit]

text: Although the basic idea of binary search is comparatively straightforward, the details can be surprisingly tricky ... — Donald Knuth[2]

text: When Jon Bentley assigned binary search as a problem in a course for professional programmers, he found that ninety percent failed to provide a correct solution after several hours of working on it, mainly because the incorrect implementations failed to run or returned a wrong answer in rare edge cases.[59] A study published in 1988 shows that accurate code for it is only found in five out of twenty textbooks.[60] Furthermore, Bentley's own implementation of binary search, published in his 1986 book Programming Pearls, contained an overflow error that remained undetected for over twenty years.  The Java programming language library implementation of binary search had the same overflow bug for more than nine years.[61]

text: In a practical implementation, the variables used to represent the indices will often be of fixed size, and this can result in an arithmetic overflow for very large arrays. If the midpoint of the span is calculated as (L + R) / 2, then the value of L + R may exceed the range of integers of the data type used to store the midpoint, even if L and R are within the range. If L and R are nonnegative, this can be avoided by calculating the midpoint as L + (R − L) / 2.[62]

text: If the target value is greater than the greatest value in the array, and the last index of the array is the maximum representable value of L, the value of L will eventually become too large and overflow. A similar problem will occur if the target value is smaller than the least value in the array and the first index of the array is the smallest representable value of R. In particular, this means that R must not be an unsigned type if the array starts with index 0.[60][62]

text: An infinite loop may occur if the exit conditions for the loop are not defined correctly. Once L exceeds R, the search has failed and must convey the failure of the search. In addition, the loop must be exited when the target element is found, or in the case of an implementation where this check is moved to the end, checks for whether the search was successful or failed at the end must be in place. Bentley found that most of the programmers who incorrectly implemented binary search made an error in defining the exit conditions.[8][63]

text: Library support[edit]

text: Many languages' standard libraries include binary search routines:

text:
C provides the function bsearch() in its standard library, which is typically implemented via binary search, although the official standard does not require it so.[64]
C++'s Standard Template Library provides the functions binary_search(), lower_bound(), upper_bound() and equal_range().[65]
COBOL provides the SEARCH ALL verb for performing binary searches on COBOL ordered tables.[66]
Go's sort standard library package contains the functions Search, SearchInts, SearchFloat64s, and SearchStrings, which implement general binary search, as well as specific implementations for searching slices of integers, floating-point numbers, and strings, respectively.[67]
Java offers a set of overloaded binarySearch() static methods in the classes Arrays and Collections in the standard java.util package for performing binary searches on Java arrays and on Lists, respectively.[68][69]
Microsoft's .NET Framework 2.0 offers static generic versions of the binary search algorithm in its collection base classes. An example would be System.Array's method BinarySearch<T>(T[] array, T value).[70]
For Objective-C, the Cocoa framework provides the NSArray -indexOfObject:inSortedRange:options:usingComparator: method in Mac OS X 10.6+.[71] Apple's Core Foundation C framework also contains a CFArrayBSearchValues() function.[72]
Python provides the bisect module.[73]
Ruby's Array class includes a bsearch method with built-in approximate matching.[74]


question_text: who stole the lightning bolt in percy jackson

text: Plot[edit]

text: In New York City, Zeus and Poseidon meet at the top of the Empire State Building, where Zeus reveals that his master lightning bolt has been stolen and accuses Poseidon's demigod son, Percy Jackson, of the theft. Poseidon reminds him that Percy is unaware of his true identity, but Zeus declares that unless his master bolt is returned to Mount Olympus before the summer solstice, in two weeks' time, war will be waged between all the gods.

text: Percy is a 16-year-old boy who appears to his peers to be dyslexic and has a unique ability to stay underwater for a long time. While on a school trip to the local museum, Percy is attacked by Alecto, a Fury disguised as his substitute teacher, Mrs. Dodds who demands the lightning bolt. Percy's best friend, Grover Underwood, and his Latin teacher, Mr. Brunner — both of whom appear disabled — help Percy and scare off the fury using a pen from Brunner. Grover tells Percy to use the pen, and Percy discovers it is a sword. Upon learning of the Fury's reason for the attack, Brunner has Grover take Percy and his mother Sally to Camp Half-Blood, leaving behind Sally's abusive husband, Gabe Ugliano. However, the three are attacked by a minotaur that appears to kill Sally, who is unable to enter the camp. He uses his sword to fight the Minotaur, without initial success. Percy kills the minotaur with its own horn, then faints from shock.

text: Three days later, Percy wakes up in the camp. He learns he is the son of Poseidon, Grover is a satyr and his protector, and Brunner is the centaur Chiron, also initially disguised. Chiron suggests that Percy go to Mount Olympus to convince Zeus of his innocence. Percy begins training to use his demigod powers, which include water manipulation and using water to heal. He also meets other demigods, including Annabeth Chase, daughter of Athena; and Luke Castellan, son of Hermes. Percy is visited by a fiery apparition of his uncle Hades, who reveals that Sally is with him in the Underworld and that he will return her safely if Percy hands over the lightning bolt. Defying Chiron's orders, Percy decides to go to the Underworld, joined by Grover and Annabeth. They visit Luke, who gives them a map showing the location of three pearls belonging to Hades' wife, Persephone, which they can use to escape the Underworld. They are also given a pair of winged sneakers Luke stole from his father and a shield Luke describes as his favorite.

text: The trio heads out, locating the first pearl at an old garden center before they suddenly encounter Medusa, who tries to kill them until decapitated by Percy; they take her head with them for later use. They locate the second pearl in the Parthenon in Nashville; Percy uses the winged shoes to take it from a statue of Athena. However, they are then confronted by the Hydra, which Grover turns to stone and kills using Medusa's head. The third pearl is located at the Lotus Casino in Las Vegas, where the three eat lotus flowers and forget their reason for being there. They stay in the casino for five days until Poseidon speaks in Percy's mind, helping Percy return to his senses. Percy frees Grover and Annabeth from the effects of the flowers and they flee, discovering that the casino is run by the Lotus-Eaters, and they had been keeping people captive since ancient times. With all three pearls, Percy, Grover, and Annabeth head into the Underworld, the portal to which is located in Hollywood.

text: In the Underworld, they meet Hades and Persephone. Though Percy tells Hades that he does not have the lightning bolt, Hades finds it hidden inside Luke's shield, revealing that Luke is the lightning thief. Persephone knocks Hades unconscious with the lightning bolt to get her revenge on him for imprisoning her for all eternity and hands the bolt to Percy. However, because they only have three pearls, Grover remains with Persephone to allow Percy's mother to leave. Percy, Annabeth, and Sally teleport to the Empire State Building but are attacked by Luke, who wants to destroy Mount Olympus to secure the demigods' place as the new rulers of Western Civilization. After a fight across Manhattan, Percy defeats and apparently kills Luke and returns the lightning bolt to Zeus, who forgives Percy and allows Poseidon to briefly speak with his son. The film ends with Percy and Annabeth reuniting with Grover, furloughed from Hades and sporting a new pair of small horns that designate his promotion to senior protector. Percy and Annabeth are reunited, and they nearly kiss but Annabeth tricks Percy and they continue to train.

text: In the post credits-scene, Ugliano is kicked out of the apartment. He decides to get a beer but finds a note from Percy saying that he should not open the refrigerator. He breaks the lock anyway and is turned to stone and killed by Medusa's head inside, though this occurs off-screen as the movie fades to black.

text: Cast[edit]

text:
Logan Lerman as Percy Jackson, the demigod son of Poseidon[9]
Brandon T. Jackson as Grover Underwood, Percy's protector, a satyr[9]
Alexandra Daddario as Annabeth Chase, the demigod daughter of Athena, and Percy's romantic foil[10]
Jake Abel as Luke Castellan, the demigod son of Hermes
Sean Bean as Zeus, god of the sky, thunder, lightning, king of the twelve gods of Mount Olympus and brother of Poseidon and Hades. He blames Percy for stealing his bolt.
Kevin McKidd as Poseidon, Percy's father, god of the seas, earthquakes, horses and brother of Zeus and Hades[11]
Steve Coogan as Hades, god of the Underworld, the dead, riches and brother of Zeus and Poseidon[12]
Melina Kanakaredes as Athena, Annabeth's mother, goddess of crafts, domestic arts, strategic warfare, peace and wisdom[11]
Rosario Dawson as Persephone, goddess of springtime and wife of Hades[12]
Dylan Neal as Hermes, Luke's father, god of trade, thieves, travelers, sports, athletes, and messenger of the gods of Mount Olympus.
Erica Cerra as Hera, goddess of birth, family, marriage, women and queen of the twelve gods of Mount Olympus, sister and wife of Zeus
Stefanie von Pfetten as Demeter, goddess of agriculture, fertility, and the harvest, sister of Zeus and mother of Persephone
Dimitri Lekkos as Apollo, god of the sun, light, knowledge, healing, plague and darkness, the arts, music, poetry, prophecy, archery, and twin brother of Artemis
Ona Grauer as Artemis, goddess of the hunt, virginity, the moon, and all animals, and twin sister of Apollo
Serinda Swan as Aphrodite, goddess of love, beauty, wife of Hephaestus and lover of Ares
Conrad Coates as Hephaestus, god of fire, forge, blacksmiths, craftsmen and husband of Aphrodite
Ray Winstone as Ares, god of war, lover of Aphrodite (uncredited)[citation needed]
Luke Camilleri as Dionysus, god of wine, celebrations, ecstasy, and theatre
Uma Thurman as Medusa, a gorgon cursed by Athena[11]
Pierce Brosnan as Chiron, also known as Mr. Brunner, a centaur who trains heroes at Camp Half-Blood, the immortal son of Kronos and brother of Zeus, Poseidon, Hades, Demeter, and Hera
Maria Olsen as Mrs. Dodds / Alecto, a Fury, servant to Hades
Julian Richings as Charon, ferryman of the River Styx, servant to Hades
Catherine Keener as Sally Jackson, Percy's mother[13]
Joe Pantoliano as Gabe Ugliano, Percy's stepfather

text: Production[edit]

text: In June 2004, 20th Century Fox acquired feature film rights to the book.[14] In April 2007, director Chris Columbus was hired to helm the project.[15] Filming began in April 2009 in Vancouver.[11] Portions of the film were shot at the Parthenon in Nashville, Tennessee, that has a full-scale replica of the original Parthenon in Athens.[16] Filming wrapped up on the morning of July 25, 2009, in Mission, British Columbia. Additional exterior scenes were filmed on location in Brooklyn, New York during the first week of August 2009.[17] Digital intermediate work began in San Francisco in November 2009.[18] Christophe Beck composed the score.[19] Columbus has stated that the cast was chosen specifically with sequels in mind. "I think with Percy Jackson it was a matter of finding the right cast to fit into these roles, sort of the perfect cast for these roles, because hopefully, God willing, we will go on to do other Percy Jackson films and you want the cast to grow with their characters".[20]

text: Reception[edit]

text: Box office[edit]

text: The film opened on February 12, 2010, in 3,356 theaters; its opening weekend box-office results totaled $31,236,067[4] in the U.S., finishing at #3 below The Wolfman, which opened at #2 with $31,479,235 and below Valentine's Day, which opened at #1 with $56,260,707.[21] The film had a strong opening weekend for its genre, posting the highest opening weekend for a fantasy film not from the Harry Potter, Chronicles of Narnia, or Lord of the Rings series.[22] As of September 14, 2010, it grossed a domestic total of $88,768,303 with $137,728,906 elsewhere in the world, bringing it to $226,497,209.[4]

text: Critical response[edit]

text: The film received mixed reviews from critics. It holds a 49% approval rating on review aggregator website Rotten Tomatoes, based on 142 collected reviews, with an average score of 5.3/10. The site's consensus reads: "Though it may seem like just another Harry Potter knockoff, Percy Jackson benefits from a strong supporting cast, a speedy plot, and plenty of fun with Greek mythology."[23] It also holds a Metacritic score of 47 out of 100, based on 31 sampled reviews, indicating "mixed to average reviews."[24] Kenneth Turan of the Los Angeles Times described the film as "standard Hollywood product... unadventurous and uninteresting".[25] The reviewer for The Washington Post thought "the movie suffers by taking itself a little too seriously. It's not just that it's a lot less funny than the book. It's also a lot less fun".[26] On BBC Radio 5, Mark Kermode criticized the similarity of the film to director Chris Columbus's Harry Potter films, likening it to a Harry Potter parody book and dubbing it Benjamin Sniddlegrass and the Cauldron of Penguins.[27] This comment later sparked a satirical fan creation with precisely that title, narrated by Stephen Fry.[28]

text: Awards and nominations[edit]

text:
Award
Category/Recipient(s)
Result
References

2010 MTV Movie Awards
Breakthrough Performance
Logan Lerman

Nominated
[29]

Best Fight
Logan Lerman vs. Jake Abel

Nominated

Teen Choice Awards 2010
Choice Movie Actress: Fantasy
Rosario Dawson

Nominated
[30][31]

Choice: Breakout Female
Alexandra Daddario

Nominated

Choice: Breakout Male
Logan Lerman

Nominated

Choice: Fight
Logan Lerman vs. Jake Abel

Nominated

37th Saturn Awards
Best Performance by a Younger Actor
Logan Lerman

Nominated
[32]

2010 Scream Awards
Best Cameo
"Rosario Dawson"

Nominated
[33]

text: Soundtrack[edit]

text:
Percy Jackson & the Olympians: The Lightning Thief

Soundtrack album by Christophe Beck

Released
February 9, 2010 (2010-02-09)

Genre
Soundtrack

Length
59:07

Label
ABKCO Records

text: All music composed by Christophe Beck.

text:
No.
Title
Length

1.
"Prelude"
2:29

2.
"The Minotaur"
5:09

3.
"Chiron"
2:02

4.
"Victory"
1:32

5.
"The Fury"
2:16

6.
"Dyslexia"
1:02

7.
"The Hydra"
6:54

8.
"Medusa"
2:43

9.
"Son of Poseidon"
1:57

10.
"The Parthenon"
3:42

11.
"Hollywood"
2:32

12.
"Lost Souls"
2:35

13.
"Fighting Luke, Part 1"
3:54

14.
"Fighting Luke, Part 2"
2:47

15.
"Hades"
2:47

16.
"Mount Olympus"
1:27

17.
"Poseidon"
3:07

18.
"Homecoming"
3:06

19.
"End Credits"
7:12

text: Songs featured in the film that were not included in the soundtrack:

text:
No.
Title
Music
Length

1.
"Highway to Hell"
AC/DC
3:28

2.
"I'll Pretend"
Dwight Yoakam
2:22

3.
"A Little Less Conversation"
Elvis Presley
3:30

4.
"Poker Face"
Lady Gaga
3:58

5.
"Mama Told Me (Not to Come)"
Three Dog Night
2:58

6.
"Tik Tok"
Kesha
3:21

text: Video game[edit]

text: A video game based on the film developed by Activision was released for Nintendo DS on February 11, 2010.[34] GameZone's Michael Splechta gave it a 6/10, saying "Percy Jackson might not make a splash when it comes to movie tie-in games, but fans of turn-based combat might find some redeeming qualities in this otherwise bare-bones game."[35] On Metacritic, which assigns a normalised rating out of 100 based on reviews from critics, the game has a score of 56 (citing "mixed or average reviews") based on 6 reviews.[36]

text: Home media[edit]

text: The film was released on June 29, 2010 on DVD[7] and Blu-ray.[8] The movie itself charted at the top of the charts (DVD sales) with $13,985,047 in revenue in its first week.[37] As of October 2011, the movie had sold 2,087,368 DVDs with over $37 million in sales.[38]

text: Stand-alone sequel[edit]

text: In October 2011, 20th Century Fox announced a stand-alone sequel based on the second book, The Sea of Monsters.[39][40] The film was released on August 7, 2013.[41]


document_title: FIFA World Cup awards

question_text: who gets the golden boot in world cup

question_tokens: who gets the golden boot in world cup

text: FIFA World Cup awards

text: Awards

text: There are currently five post-tournament awards, and one given during the tournament:[1]

text:
the Golden Ball (currently commercially termed "adidas Golden Ball") for best player, first awarded in 1982;
the Golden Boot (currently commercially termed "adidas Golden Boot", previously known as the "adidas Golden Shoe" from 1982 to 2006) for top goal scorer, first awarded in 1982;
the Golden Glove Award (currently commercially termed "adidas Golden Glove"; previously known as the "Lev Yashin Award" from 1994 to 2006) for best goalkeeper, first awarded in 1994;
the Best Young Player (currently commercially termed as "Hyundai Best Young Player") award for best player under 21 years of age at the start of the calendar year, first awarded in 2006;
the FIFA Fair Play Trophy for the team that advanced to the second round with the best record of fair play, first awarded in 1970;
the Man of the Match Award (currently commercially termed as "Budweiser Man of the Match") for outstanding performance during each game of the tournament, first awarded in 2002.

text: Two other awards were given between 1994 and 2006:[2]

text:
The Most Entertaining Team award for the team that has entertained the public the most, during the World Cup final tournament, as determined by a poll of the general public;
An All-Star Team comprising the best players of the tournament chosen  by the technical study group.

text: Golden Ball

text: The Golden Ball award is presented to the best player at each FIFA World Cup finals, with a shortlist drawn up by the FIFA technical committee and the winner voted for by representatives of the media. Those who finish as runners-up in the vote receive the Silver Ball and Bronze Ball awards as the second and third most outstanding players in the tournament respectively. The current award was introduced in the 1982 FIFA World Cup, sponsored by Adidas and France Football, though fifa.com also lists in their player articles as "golden ball winners" Kempes, Cruyff, Pelé, Bobby Charlton, Garrincha and Didi for 1978, 1974, 1970, 1966, 1962 and 1958 respectively.[3] Barcelona is the only club whose players have won the Golden Ball a record 3 times (Johan Cruyff in 1974, Romário in 1994, Lionel Messi in 2014).[4]

text:
Golden Ball[5]

World Cup

Golden Ball

Silver Ball

Bronze Ball

1930 Uruguay

 José Nasazzi

 Guillermo Stábile

 José Leandro Andrade

1934 Italy

 Giuseppe Meazza

 Matthias Sindelar

 Oldřich Nejedlý

1938 France

 Leônidas

 Silvio Piola

 György Sárosi

1950 Brazil

 Zizinho

 Juan Alberto Schiaffino

 Ademir

1954 Switzerland

 Ferenc Puskás

 Sándor Kocsis

 Fritz Walter

1958 Sweden

 Didi

 Pelé

 Just Fontaine

1962 Chile

 Garrincha

 Josef Masopust

 Leonel Sánchez

1966 England

 Bobby Charlton

 Bobby Moore

 Eusébio

1970 Mexico

 Pelé

 Gérson

 Gerd Müller

1974 West Germany

 Johan Cruyff

 Franz Beckenbauer

 Kazimierz Deyna

1978 Argentina

 Mario Kempes

 Paolo Rossi

 Dirceu

1982 Spain

 Paolo Rossi

 Falcão

 Karl-Heinz Rummenigge

1986 Mexico

 Diego Maradona

 Harald Schumacher

 Preben Elkjær Larsen

1990 Italy

 Salvatore Schillaci

 Lothar Matthäus

 Diego Maradona

1994 United States

 Romario

 Roberto Baggio

 Hristo Stoichkov

1998 France

 Ronaldo

 Davor Šuker

 Lilian Thuram

2002 Korea/Japan

 Oliver Kahn

 Ronaldo

 Hong Myung-bo

2006 Germany

 Zinedine Zidane

 Fabio Cannavaro

 Andrea Pirlo

2010 South Africa

 Diego Forlán

 Wesley Sneijder

 David Villa

2014 Brazil

 Lionel Messi

 Thomas Müller

 Arjen Robben

2018 Russia

 Luka Modrić

 Eden Hazard

 Antoine Griezmann

text: Golden Boot

text: The Golden Boot or Golden Shoe Award goes to the top goalscorer of the FIFA World Cup. While every World Cup had a ranking of the goalscorers, the first time an award was given was in 1982,[6] under the name Golden Shoe.[3] It was rechristened Golden Boot in 2010.[7] FIFA sometimes lists the top goalscorers of previous Cups among the Golden Boot winners.[8]

text: If there is more than one player with the same number of goals, since 1994 the tie-breaker goes to the player without a penalty goal, if none has a penalty then the tie breaker goes to the person with more assists - with the FIFA Technical Study Group deciding whether an assist is to be counted as such.[9][10] If there is still more than one player, the tie-breaker since 2006 goes to the player who has played the least amount of time, which translates to a higher goal average.[11]

text:
Top Goalscorer[12][13]

World Cup

Top goalscorer

Goals

Runners-up

Goals

Third place

Goals

1930 Uruguay

 Guillermo Stábile

8

 Pedro Cea

5

 Bert Patenaude

4

1934 Italy

 Oldřich Nejedlý

5[a]

 Edmund Conen Angelo Schiavio

4

None

—

1938 France

 Leônidas

7[b]

 György Sárosi Gyula Zsengellér Silvio Piola

5

1950 Brazil

 Ademir

8[c]

 Óscar Míguez

 Alcides Ghiggia Chico Estanislau Basora Telmo Zarra

4

1954 Switzerland

 Sándor Kocsis

11

 Josef Hügi Max Morlock Erich Probst

6

None

—

1958 Sweden

 Just Fontaine

13

 Pelé Helmut Rahn

1962 Chile

 Flórián Albert Valentin Ivanov Garrincha Vavá Dražan Jerković Leonel Sánchez

4

None

—

1966 England

 Eusébio

9

 Helmut Haller

6

 Valeriy Porkujan Geoff Hurst Ferenc Bene Franz Beckenbauer

4

1970 Mexico

 Gerd Müller

10

 Jairzinho

7

 Teófilo Cubillas

5

1974 West Germany

 Grzegorz Lato

7

 Andrzej Szarmach Johan Neeskens

5

None

1978 Argentina[17]

 Mario Kempes

6

 Teófilo Cubillas

 Rob Rensenbrink

5

Golden Shoe[8]

World Cup

Golden Shoe

Goals

Silver Shoe

Goals

Bronze Shoe

Goals

1982 Spain

 Paolo Rossi

6

 Karl-Heinz Rummenigge

5

 Zico

4

1986 Mexico

 Gary Lineker

 Emilio Butragueño Careca Diego Maradona

None[18]

1990 Italy

 Salvatore Schillaci

 Tomáš Skuhravý

 Roger Milla  Gary Lineker

4

1994 United States

 Oleg Salenko[d] Hristo Stoichkov[e]

None

—

 Kennet Andersson Romário

5[f]

1998 France[20]

 Davor Šuker

 Gabriel Batistuta Christian Vieri

5

None[g]

2002 South Korea/Japan[21]

 Ronaldo

8[h]

 Miroslav Klose Rivaldo

2006 Germany[23]

 Miroslav Klose

5

 Hernán Crespo

3[i]

 Ronaldo

3[i]

Golden Boot[8]

World Cup

Golden Boot

Goals

Silver Boot

Goals

Bronze Boot

Goals

2010 South Africa

 Thomas Müller

5[j]

 David Villa

5[j]

 Wesley Sneijder

5[j]

2014 Brazil

 James Rodríguez

6

 Thomas Müller

5

 Neymar

4[k]

2018 Russia

 Harry Kane

 Antoine Griezmann

4[l]

 Romelu Lukaku

4[l]

Notes

Jump up ^ FIFA initially credited Nejedlý with only four goals, which would make him joint top scorer with Angelo Schiavio of Italy and Edmund Conen of Germany. However, FIFA changed it to five goals in November 2006, making Nejedlý the outright top scorer.[14]

Jump up ^ FIFA initially credited Leônidas with eight goals. However, in November 2006, FIFA confirmed that in the quarter-final tie against Czechoslovakia, he had scored once, not twice as FIFA had originally recorded, meaning he had scored only seven goals in total.[14]

Jump up ^ There was controversy regarding the number of goals Brazilian Ademir had scored in 1950, as a result of incomplete data concerning the Final Round game Brazil vs. Spain (6–1). The 5–0 goal had been credited to Jair, but is now credited to Ademir.[15][16]

Jump up ^ Salenko is the only player to win the award playing for a team that were eliminated in the group stages. His six goals are the only international goals he ever scored.

Jump up ^ Despite the assist tiebreaker, Salenko and Stoichkov remained tied with 6 goals and one assist each, and both received the Golden Shoe.[9]

Jump up ^ Romário and Andersson surpassed the other two players with five goals (Jürgen Klinsmann and Roberto Baggio) by having three assists each.[9][19]

Jump up ^ Both runners-up had the same number of assists, and each received the Silver Shoe.

Jump up ^ During the tournament, after the group stage match against Costa Rica, Ronaldo logged a protest against the crediting of a goal as an own goal, and FIFA granted him the change.[22]

^ Jump up to: a b Eight players had scored three goals. Ronaldo, Crespo and Zinedine Zidane stood out for having one assist, and then the two recipients were determined by less playtime (308 minutes for Crespo, 411 for Ronaldo, 559 for Zidane).[24]

^ Jump up to: a b c Müller, Villa, Sneijder and Diego Forlán tied with five goals. Müller won by virtue of having more assists (3) than the rest (each had one). Villa won the Silver Boot due to playing fewer minutes than Sneijder, and Sneijder won the Bronze Boot due to having played fewer minutes than Forlán.[25]

Jump up ^ Neymar, Lionel Messi and Robin van Persie all had four goals in the tournament. Neymar received the Bronze Boot for playing fewer minutes than his competitors (480; Messi played 693 minutes, and Van Persie, 548).[26]

^ Jump up to: a b Griezmann, Lukaku, Denis Cheryshev, Cristiano Ronaldo and Kylian Mbappé tied with 4 goals. Griezmann won the Silver Boot by virtue of having more assists (2) than the rest (Lukaku had one, the rest had zero). Lukaku won the Bronze Boot due to having more assists (one) than Cheryshev, Ronaldo or Mbappé (zero).[27]

text: Golden Glove

text: The Golden Glove Award is awarded to the best goalkeeper of the tournament. The award was introduced with the name Lev Yashin Award in 1994, in honor of the late Soviet goalkeeper.[6] The FIFA Technical Study Group recognises the top goalkeeper of the tournament based on the player's performance throughout the final competition. Although goalkeepers have this specific award for their position, they are still eligible for the Golden Ball as well, as when Oliver Kahn was awarded in 2002. Although the Golden Glove Award was first awarded in 1994, every All-Star Team in World Cups prior to 1998 except 1990 included only one goalkeeper. In the event of a tie, the Golden Glove Award goes to the goalkeeper who progressed furthest in the competition. The next tiebreakers are saves made, then minutes played.

text:
World Cup

Golden Glove

1930 Uruguay

 Enrique Ballestrero

1934 Italy

 Ricardo Zamora

1938 France

 František Plánička

1950 Brazil

 Roque Máspoli

1954 Switzerland

 Gyula Grosics

1958 Sweden

 Harry Gregg

1962 Chile

 Viliam Schrojf

1966 England

 Gordon Banks

1970 Mexico

 Ladislao Mazurkiewicz

1974 West Germany

 Sepp Maier

1978 Argentina

 Ubaldo Fillol

1982 Spain

 Dino Zoff

1986 Mexico

 Jean-Marie Pfaff

1990 Italy

 Luis Gabelo Conejo Sergio Goycochea

1994 United States

 Michel Preud'homme

1998 France

 Fabien Barthez

2002 Korea/Japan

 Oliver Kahn

2006 Germany

 Gianluigi Buffon

2010 South Africa

 Iker Casillas

2014 Brazil

 Manuel Neuer

2018 Russia

 Thibaut Courtois

text: Best Young Player Award

text: The Best Young Player award was awarded for the first time at the 2006 World Cup in Germany and given to Germany's Lukas Podolski.[28] The award is given to the best player in the tournament who is at most 21 years old.  For the 2018 World Cup, this meant that the player had to have been born on or after 1 January 1997. The election took place on FIFA's official World Cup website with the help of The FIFA Technical Study Group.[29]

text: FIFA organised a survey on the Internet for users to choose the "best young player" of the World Cup, between 1958 and 2002, named the best young player of each tournament.[30] With 61% of the overall vote, the winner was Pelé, who finished ahead of the Peruvian Teófilo Cubillas, the best young player at Mexico 1970, and England's Michael Owen, who reached similar heights at France 98.[31]

text:
YPA[32]

World Cup

Best Young Player

Age

1958 Sweden

 Pelé

17

1962 Chile

 Flórián Albert

20

1966 England

 Franz Beckenbauer

20

1970 Mexico

 Teófilo Cubillas

21

1974 West Germany

 Władysław Żmuda

20

1978 Argentina

 Antonio Cabrini

1982 Spain

 Manuel Amoros

21

1986 Mexico

 Enzo Scifo

20

1990 Italy

 Robert Prosinečki

21

1994 United States

 Marc Overmars

1998 France

 Michael Owen

18

2002 Korea/Japan

 Landon Donovan

20

2006 Germany

 Lukas Podolski[28]

21

2010 South Africa

 Thomas Müller[33]

20

2014 Brazil

 Paul Pogba[34]

21

2018 Russia

 Kylian Mbappé[35]

19

text: FIFA Fair Play Trophy

text: The FIFA Fair Play Trophy is given to the team with the best record of fair play during the World Cup final tournament since 1970. Only teams that qualified for the second round are considered. The winners of this award earn the FIFA Fair Play Trophy, a diploma, a fair play medal for each player and official, and $50,000 worth of football equipment to be used for youth development.[36]

text: The appearance of the award was originally a certificate. From 1982 to 1990, it had been a golden trophy based on Sport Billy, a football-playing cartoon character from 1982 who became an icon for FIFA Fair play.[37][38] Ever since 1994, it is simply a trophy with an elegant footballer figure.[39] Peru was the first nation to win the award after receiving no yellow or red cards in the 1970 FIFA World Cup held in Mexico.[40]

text:
World Cup

FIFA Fair Play Trophy Winners

1970 Mexico

 Peru

1974 West Germany

 West Germany

1978 Argentina

 Argentina

1982 Spain

 Brazil

1986 Mexico

 Brazil

1990 Italy

 England

1994 United States

 Brazil

1998 France

 England France

2002 Korea/Japan

 Belgium

2006 Germany

 Brazil Spain

2010 South Africa

 Spain

2014 Brazil

 Colombia

2018 Russia

 Spain

text: Man of the Match

text: The Man of the Match award picks the outstanding player in every game of the tournament since 2002. While the inaugural two editions were chosen by the technical group,[41][42] the Man of the Match is since 2010 picked by an online poll on FIFA's website.[43][44]

text:
World Cup

Most Man of the Match wins

Wins

2002 South Korea/Japan

 Rivaldo

3

2006 Germany

 Andrea Pirlo

3

2010 South Africa

 Wesley Sneijder

4

2014 Brazil

 Lionel Messi

4

2018 Russia

 Antoine Griezmann Eden Hazard Harry Kane Luka Modrić

3

text: Total awardsAs of 15 July 2018

text:
Rank

Player

Country

MoM

WC with awards

1

Arjen Robben
 Netherlands
6
2006, 2010, 2014

Cristiano Ronaldo
 Portugal
2010, 2014, 2018

Lionel Messi
 Argentina
2010, 2014, 2018

4

Luis Suárez
 Uruguay
5
2010, 2014, 2018

5

Eden Hazard
 Belgium
4
2014, 2018

Keisuke Honda
 Japan
2010, 2014

James Rodríguez
 Colombia
2014, 2018

Miroslav Klose
 Germany
2002, 2006

Park Ji-sung
 South Korea
2002, 2006, 2010

Thomas Müller
 Germany
2010, 2014

Wesley Sneijder
 Netherlands
2010

text: By CountryAs of 15 July 2018

text:
Rank

Country

MoM

Players

1

 Brazil
22
14

 Germany
12

3

 France
17
11

4

 Spain
16
10

5

 Argentina
15
8

6

 England
14
12

7

 Mexico
12
10

 Netherlands
3

9

 South Korea
11
7

 Portugal
6

 United States
7

text: Most Entertaining Team

text: The FIFA Award for the Most Entertaining Team is a subjectively awarded prize for the team that had done the most to entertain the public with a positive approach to the game, organised through public participation in a poll[6] starting in 1994.[7]

text:
World Cup

Most Entertaining Team Award

1994 United States

 Brazil[23]

1998 France

 France[23]

2002 Korea/Japan

 South Korea[45]

2006 Germany

 Portugal[46]

2010 South Africa

 Germany[47]

2014 Brazil

 Colombia[48]

text: All-Star Team

text: The All-Star Team is a team of the best performers at the respective World Cup finals. The ways in which the FIFA All-Star team members have been chosen has varied from year to year.  A technical study group consisting of journalists - mostly from Europe and South America - and experts has historically chosen the team.[49] However, in 1994 FIFA decided to add an official squad, chosen by the FIFA technical group and under the brand name MasterCard All-Star Team.[50] For 1998, 2002 and 2006, substitute and reserve members were also nominated for full 22 and 23-player squads. The All-Star team wound up dropped prior to the 2010 tournament - coincidentally, three years after FIFA changed its sponsorship from MasterCard to Visa.[51]

text:
All Star Team

World Cup

Goalkeepers

Defenders

Midfielders

Forwards

1930 Uruguay

 Enrique Ballestrero

 José Nasazzi
 Milutin Ivković

 Luis Monti
 Álvaro Gestido
 José Leandro Andrade

 Pedro Cea
 Héctor Castro
 Héctor Scarone
 Guillermo Stábile
 Bert Patenaude

1934 Italy

 Ricardo Zamora

 Jacinto Quincoces
 Eraldo Monzeglio

 Luis Monti
 Attilio Ferraris
 Leonardo Cilaurren

 Giuseppe Meazza
 Raimundo Orsi
 Enrique Guaita
 Matthias Sindelar
 Oldřich Nejedlý

1938 France

 František Plánička

 Pietro Rava
 Alfredo Foni
 Domingos da Guia

 Michele Andreolo
 Ugo Locatelli

 Silvio Piola
 Gino Colaussi
 György Sárosi
 Gyula Zsengellér
 Leônidas

1950 Brazil

 Roque Máspoli

 Erik Nilsson
 José Parra
 Víctor Rodríguez Andrade

 Obdulio Varela
 Bauer
 Alcides Ghiggia
 Jair

 Zizinho
 Ademir
 Juan Alberto Schiaffino

1954 Switzerland

 Gyula Grosics

 Ernst Ocwirk
 Djalma Santos
 José Santamaría

 Fritz Walter
 József Bozsik
 Nándor Hidegkuti
 Zoltán Czibor

 Helmut Rahn
 Ferenc Puskás
 Sándor Kocsis

1958 Sweden

 Harry Gregg

 Djalma Santos
 Bellini
 Nílton Santos

 Danny Blanchflower
 Didi
 Gunnar Gren
 Raymond Kopa

 Pelé
 Garrincha
 Just Fontaine

1962 Chile

 Viliam Schrojf

 Djalma Santos
 Cesare Maldini
 Valery Voronin
 Karl-Heinz Schnellinger

 Mário Zagallo
 Zito
 Josef Masopust

 Vavá
 Garrincha
 Leonel Sánchez

1966 England

 Gordon Banks

 George Cohen
 Bobby Moore
 Vicente
 Silvio Marzolini

 Franz Beckenbauer
 Mário Coluna
 Bobby Charlton

 Flórián Albert
 Uwe Seeler
 Eusébio

1970 Mexico

 Ladislao Mazurkiewicz

 Carlos Alberto
 Atilio Ancheta
 Franz Beckenbauer
 Giacinto Facchetti

 Gérson
 Rivellino
 Bobby Charlton

 Pelé
 Gerd Müller
 Jairzinho

1974 West Germany

 Sepp Maier

 Ruud Krol
 Paul Breitner
 Elias Figueroa[52]
 Franz Beckenbauer
 Berti Vogts

 Wolfgang Overath
 Kazimierz Deyna
 Johan Neeskens

 Rob Rensenbrink
 Johan Cruyff
 Grzegorz Lato

1978 Argentina

 Ubaldo Fillol

 Berti Vogts
 Ruud Krol
 Daniel Passarella
 Alberto Tarantini

 Dirceu
 Teófilo Cubillas
 Rob Rensenbrink

 Roberto Bettega
 Paolo Rossi
 Mario Kempes

1982 Spain

 Dino Zoff

 Luizinho
 Júnior
 Claudio Gentile
 Fulvio Collovati

 Zbigniew Boniek
 Falcão
 Michel Platini
 Zico

 Paolo Rossi
 Karl-Heinz Rummenigge

1986 Mexico

 Jean-Marie Pfaff

 Josimar
 Manuel Amoros
 Júlio César

 Jan Ceulemans
 Jean Tigana
 Michel Platini
 Diego Maradona

 Preben Elkjær Larsen
 Emilio Butragueño
 Gary Lineker

1990 Italy

 Sergio Goycochea
 Luis Gabelo Conejo

 Andreas Brehme
 Paolo Maldini
 Franco Baresi

 Diego Maradona
 Lothar Matthäus
 Dragan Stojković
 Paul Gascoigne

 Salvatore Schillaci
 Roger Milla
 Jürgen Klinsmann

text:
MasterCard All Star Team

World Cup

Goalkeepers

Defenders

Midfielders

Forwards

1994 United States[50]

 Michel Preud'homme

 Jorginho
 Márcio Santos
 Paolo Maldini

 Dunga
 Krasimir Balakov
 Gheorghe Hagi
 Tomas Brolin

 Romário
 Hristo Stoichkov
 Roberto Baggio

1998 France[53](1)

 Fabien Barthez
 José Luis Chilavert

 Roberto Carlos
 Marcel Desailly
 Lilian Thuram
 Frank de Boer
 Carlos Gamarra

 Dunga
 Rivaldo
 Michael Laudrup
 Zinedine Zidane
 Edgar Davids

 Ronaldo
 Davor Šuker
 Brian Laudrup
 Dennis Bergkamp

2002 Korea/Japan[54](2)

 Oliver Kahn
 Rüştü Reçber

 Roberto Carlos
 Sol Campbell
 Fernando Hierro
 Hong Myung-bo
 Alpay Özalan

 Rivaldo
 Ronaldinho
 Michael Ballack
 Claudio Reyna
 Yoo Sang-chul

 Ronaldo
 Miroslav Klose
 El Hadji Diouf
 Hasan Şaş

2006 Germany[55]

 Gianluigi Buffon
 Jens Lehmann
 Ricardo

 Roberto Ayala
 John Terry
 Lilian Thuram
 Philipp Lahm
 Fabio Cannavaro
 Gianluca Zambrotta
 Ricardo Carvalho

 Zé Roberto
 Patrick Vieira
 Zinedine Zidane
 Michael Ballack
 Andrea Pirlo
 Gennaro Gattuso
 Luís Figo
 Maniche

 Hernán Crespo
 Thierry Henry
 Miroslav Klose
 Luca Toni
 Francesco Totti

text: 1 In addition to the 16 of the All-Star Team, 6 reserves were listed:  Edwin van der Sar,  Juan Sebastián Verón,  Thierry Henry,  Jay-Jay Okocha,  Michael Owen, and  Christian Vieri.[53]

text: 2 Again there were seven reserves:  Iker Casillas,  Cafu,  Dietmar Hamann,  Joaquín,  Hidetoshi Nakata,  Landon Donovan, and  Marc Wilmots.[54]

text: In 2010, an equivalent of the All Star Team was an online poll to FIFA.com Club members named "Dream Team", sponsored by Yingli.[56] The Dream Team poll returned the following edition sponsored by Oi,[57] and again in 2018 sponsored by Hisense.[58]

text:
Dream Team

World Cup

Goalkeepers

Defenders

Midfielders

Forwards

Manager

2010 South Africa[56]

 Iker Casillas

 Philipp Lahm  Sergio Ramos  Carles Puyol  Maicon

 Xavi  Bastian Schweinsteiger  Wesley Sneijder  Andrés Iniesta

 David Villa  Diego Forlán

 Vicente del Bosque

2014 Brazil[57]

 Manuel Neuer

 Marcelo Mats Hummels Thiago Silva David Luiz

 Ángel Di María Toni Kroos James Rodríguez

 Lionel Messi Thomas Müller Neymar

 Joachim Löw

2018 Russia[59]

 Thibaut Courtois

 Raphaël Varane  Thiago Silva  Diego Godín  Marcelo

 Luka Modrić  Philippe Coutinho  Kevin De Bruyne

 Kylian Mbappé  Harry Kane  Cristiano Ronaldo

text: While FIFA did not release an official list for 2014, official sponsor Castrol published a team of the tournament based on their Castrol Performance Index, which evaluates players' performances through statistical data.[60]

text:
Castrol Index Top 11

World Cup

Goalkeepers

Defenders

Midfielders

Forwards

2014 Brazil[60]

 Manuel Neuer

 Marcos Rojo Mats Hummels Thiago Silva Stefan de Vrij

 Oscar Toni Kroos Philipp Lahm James Rodríguez

 Arjen Robben Thomas Müller

text:
Fantasy McDonald’s Overall XI

World Cup

Goalkeepers

Defenders

Midfielders

Forwards

2018 Russia[61]

 Thibaut Courtois

 Andreas Granqvist Raphaël Varane Thiago Silva Yerry Mina

 Denis Cheryshev Philippe Coutinho Luka Modrić

 Harry Kane Eden Hazard Antoine Griezmann

text:
Only two players have been named in three separate All-Star teams whose selection only included the starting eleven: Djalma Santos in 1954, 1958 and 1962, Franz Beckenbauer in 1966, 1970 and 1974. Philipp Lahm also achieved it in 2006, 2010 and 2014. However, the 2006 edition listed 23 players and 2014 had two All-Star team listed. Lahm's name has only been in one of these.
21 players have been named in two separate All-Star teams: Luis Monti (1930 and 1934; representing Argentina and Italy respectively); Garrincha (1958 and 1962); Pelé (1958 and 1970); Bobby Charlton (1966 and 1970); Ruud Krol and Rob Rensenbrink (1974 and 1978); Berti Vogts (1974 and 1978); Paolo Rossi (1978 and 1982); Michel Platini (1982 and 1986); Diego Maradona (1986 and 1990); Paolo Maldini (1990 and 1994); Dunga (1994 and 1998); Roberto Carlos, Rivaldo, and Ronaldo (1998 and 2002); Lilian Thuram and Zinedine Zidane (1998 and 2006); Michael Ballack and Miroslav Klose (2002 and 2006); Marcelo and Thiago Silva (2014 and 2018).
Pelé hold the record of the longest time between being named in two separate All-Star teams by 12 years apart (1958 and 1970).
Uruguay in 1930 and 1950,  Spain in 2010 and Germany in 2014 are the only teams to have had a player in every position on the All-Star Team. Germany and Italy achieved it in 2006, however, the 2006 edition listed 23 players.
Uruguay in 1930 and Italy in 2006 have the most players selected in the All-Star Team with 7 players each. However, the 1930 selection only had 11 players overall, while the 2006 selection had 23.
37 different Brazilian players have been named in All-Star teams, Brazil is also the nation with most nominations with 44 nominees in every position except goalkeeper.
Only two Asian players have been named in All-Star teams, Hong Myung-bo and Yoo Sang-chul of South Korea. Another Asian player Hidetoshi Nakata has been named in reserves. All three players were selected in 2002.
Similarly, only two African players have been named in All-Star teams, Roger Milla from Cameroon in 1990 and El Hadji Diouf from Senegal in 2002.
Only one player on the victorious 1986 Argentina team, Diego Maradona, was selected in that year's All-Star team.
Uniquely, brothers Brian Laudrup and Michael Laudrup were both selected for the All Star Team from Denmark in 1998.
Similarly, Cesare Maldini and Paolo Maldini are the only father and son players that were both selected for the All Star Team from Italy, in 1962 and 1990, 1994 respectively.
Uniquely, Argentinian compatriots Diego Maradona (1979 and 1986) and Lionel Messi (2005 and 2014) are the only players that won the Golden Ball award at both FIFA World Cup and FIFA World Youth Championship.

text: Goal of the Tournament

text:
World Cup

Player

Scored against

Source

2006 Germany

 Maxi Rodríguez

 Mexico

[62]

2010 South Africa

 Diego Forlan

 Germany

2014 Brazil

 James Rodriguez

 Uruguay

2018 Russia

 Benjamin Pavard

 Argentina