Clifford Heap

Clifford Heap
Clifford Heap
Personal information
Full name Clifford Heap
Date of birth 14 February 1906
Place of birth Burnley, England
Date of death 1984 (aged 77 or 78)
Playing position Full back
Senior career*
Years Team Apps (Gls)
1928–1930 Burnley 5 (0)
1930–1931 Thames 13 (0)
1931 Clitheroe ? (?)
1931–1932 Millwall 0 (0)
1932 Accrington Stanley 4 (0)
1933 Tunbridge Wells Rangers
* Senior club appearances and goals counted for the domestic league only.
† Appearances (Goals).

Clifford Heap (14 February 1906–1984) was an English professional association footballer who played as a full back.

References

  • Joyce, Michael (2004). Football League Players' Records 1888-1939. 



Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Binomial heap — In computer science, a binomial heap is a heap similar to a binary heap but also supporting the operation of merging two heaps quickly. This is achieved by using a special tree structure. It is important as an implementation of the mergeable heap …   Wikipedia

  • Fibonacci heap — In computer science, a Fibonacci heap is a heap data structure consisting of a forest of trees. It has a better amortized running time than a binomial heap. Fibonacci heaps were developed by Michael L. Fredman and Robert E. Tarjan in 1984 and… …   Wikipedia

  • Binomial-Heap — In der Informatik ist ein Binomial Heap eine Datenstruktur, genauer ein Heap, der sich, ähnlich wie binäre Heaps, als Vorrangwarteschlange einsetzen lässt. Das heißt, dass in beliebiger Reihenfolge effizient Elemente mit festgelegter Priorität in …   Deutsch Wikipedia

  • Ronnie Le Drew — is a puppeteer who was born in Toronto, Canada and trained at the Little Angel Theatre, London under John Wright. His association With the Little Angel spans over thirty years as performer, and later as director. Other theatre credits have… …   Wikipedia

  • Heapsort — Infobox Algorithm class=Sorting algorithm A run of the heapsort algorithm sorting an array of randomly permuted values. In the first stage of the algorithm the array elements are reordered to satisfy the heap property. Before the actual sorting… …   Wikipedia

  • Priority queue — A priority queue is an abstract data type in computer programming. It is exactly like a regular queue or stack data structure, but additionally, each element is associated with a priority . stack: elements are pulled in last in first out order (e …   Wikipedia

  • Fraggle Rock — For the animated television series, see Fraggle Rock (animated TV series). Fraggle Rock Also known as Jim Henson s Fraggle Rock Created by Jim Henson …   Wikipedia

  • Grammy Awards 2010 — Am 31. Januar 2010 wurden im Staples Center von Los Angeles die Grammy Awards 2010 verliehen. Es war die 52. Verleihung des Grammys, des wichtigsten US amerikanischen Musikpreises. Gewürdigt wurden Anfang 2010 die musikalischen Leistungen, die… …   Deutsch Wikipedia

  • Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… …   Wikipedia

  • Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”