Alewife Cambridge, and Somerville to the Mystic River. The brook gives its name to the Alewife Brook Parkway and the Alewife Brook Reservation. The Red Line (MBTA) of Boston's T ends at the Alewife station, so the name of this fish adorns the front of every northbound Red Line train. In the Southeast US, when sold and used as bait, the fish is often referred to as "LY". Both anadromous and landlocked forms occur. The landlocked form is also called a sawbelly or mooneye (although this latter name is more commonly applied to "Hiodon" spp.). Adult alewives are caught during their
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