Alewife (or kyack). In Atlantic Canada it is known as the gaspereau, from the Acadian French word "gasparot", first mentioned by Nicolas Denys. William Francis Ganong, New Brunswick biologist and historian, wrote: Gaspereau, or Gasparot. Name of a common salt-water fish of Acadia (also called alewife), first used, so far as I can find, by Denys in 1672. Nowhere can I find any clue to its origin. It seems not to be Indian. Acadians named two rivers after the fish, the Gaspereau River in Nova Scotia and the Gaspereaux River in New Brunswick. In eastern Massachusetts, Alewife Brook flows through Arlington,
Merge sort Merge sort In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the order of equal elements is the same in the input and output. Merge sort is a divide and conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up mergesort appeared in a report by Goldstine and von Neumann as early as 1948. Conceptually, a merge sort works as follows: Example C-like code using indices for top-down merge sort algorithm that recursively splits the list