In this task you will be given a text passage from a trivia quiz. You should choose the category this question belongs to from these categories: History, Science, Social Science, Fine Arts, Literature. You can only choose one category, so if in doubt, please choose the closest match.

[EX Q]: This philosopher argued for a hybrid approach of historical materialism and psychoanalysis that he termed the "progressive-regressive method." He used the example of a man that fails to meet his friend after walking into a cafe to illustrate the second title concept of one of his works. This man densely analyzed the life of Gustave Flaubert in his book length study The Family Idiot. His short treatise (*) Search for a Method recapitulates themes of another of his books, which calls humanity a "fused group." This author of Critique of Dialectical Reason argued that the object of consciousness exists as "in-itself," but experience exists "for itself" in a book that argues the authentic life is one way to escape the grip of "bad faith." For 10 points, name this existentialist author of Being and Nothingness.
[EX A]: Social Science

[EX Q]: Coombs tests detect these bodies bound to erythrocytes, and a technique that uses these entities is ELISA. These molecules have a namesake fold, in which two beta sheets are held together by amino acid charges. These adaptable molecules can somatically recombine in a process called V(D)J recombination and are also capable of changing isotype by altering conformation of their heavy chains. Like enzymes, they operate via a a so-called "lock-and-key" mechanism, as verified by Linus Pauling. FTP, name these characteristically y-shaped immune molecules exploited in vaccination and produced by B cells in response to specific antigens.
[EX A]: Science

[EX Q]: In 1999, McIlroy created an adversary for this algorithm that guarantees that it will run in worst-case time. Its worst-case runtime can be avoided by switching to heapsort after a certain recursion depth, a construction known as introsort. Like mergesort, it is easily parallelizable, and its runtime can be decreased by first selecting the median of the unsorted input list. It was invented by C.A.R. Hoare, and its second phase is the partition function, which splits the original list into lists of elements that are greater or less than the chosen pivot value. For 10 points, identify this divide-and-conquer sorting algorithm which runs in big O of n log n time, named for its speed.
[EX A]:
Science