?10E Devise an algorithm that finds the closest pair of integers in a sequence of ?n integers, and determine the worst-case complexity of your algorithm. [?Hint: Sort the sequence. Use the fact that sorting can be done with worst-case time complexity O? ? (?n? l? ?).] The ?shaker sort (or ?bidirectional bubble sort ) successively compares pairs of adjacent elements, exchanging them if they are out of order, and alternately passing through the list from the beginning to the end and then from the end to the beginning until no exchanges are needed.

CHEM4270 BiochemistryI ProteinsContinued ProteinIsolation o SDSPage‐MolecularWeight‐2D SDS‐Sodiumdodecylsulfate(detergent) SDSmicellesbindtoandunfoldallproteins Giveallproteinsauniformlynegativecharge Nativeshapedoesnotmatter DependsonpH,pI,andproteinsize pHcontrolsifaminoacidswillreachpI,separatedbypI,thenplacedingelto separatebysize proteinsamplegelstripgel o HPLCPurification:BasedonPolarity Goodforanalysisofsamples Higherbufferpolarity,morepolarmoleculesarevisible ProteinSequencing o EdmanDegradation‐ClassicalMethod Takeslonger,inefficient RoundsofN‐terminalmod