Domestic search Big Brother iOS face question

<span id="Label3"><p>Each interview will be followed by a summary of the questions Asked.</p><p>This concludes my interview with an iOS face test for a large search company. Side (15min) + Two Faces (30min). And get an internship offer. of course, in Today's special holiday, I wish you a Happy new year. I hope we can all get the right offer.</p><p> <!--?xml version="1.0" encoding="UTF-8" standalone="no"?--></p>One side of the electric plane: 15min;1. algorithm: How to find the number of n large in an array (number of integers in unordered order); 2. algorithm: How to find the number of the nth size in an unordered number of 1-100 in an array ; (traversal Count) 3. Talk about the dynamics of the execution in oc; 4.OC how to find a method, through the function of the name key to find, each functions name is definitely not the Same. There is no function overload (no) in 5.OC, there is no function overload in Swift (some). 6. Memory management, Mrc,arc difference; 7.releasepool is released, will the objects inside be released? What the process is.<br>Two face surface: 30min;1.c++ and OC Memory Management comparison, and implementation method. 2. Two arrays, one with 1 million data, and one 100 million of the data, how to find the same data, what is the complexity of time? 3.OC of Mrc,arc. What are the differences between 4.c++ and oc; 5. What is the difference between swift and oc? 6. Bubble Sorting and high-speed sequencing time complexity; 7. Today OC uses more than swift, why?<br>If there is any problem, welcome to Exchange Oh ...<br><p></p><p>Domestic search Big Brother iOS face question</p></span>