esihaj / mistake Goto Github PK

Problem : Assignment 0 Input : A list of numbers Process: There is at most 1 uniqe number others are in pairs
Output : print the Unumber in a newline(num\n) if not found print (0\n) Solutions: 1) search O(n^2) for the unique number optimization: if len(list) % 2 == 0 all are in pairs optimization: keep a list of bool seen_flag-> so as not to check every element 2)std::sort => practically best algorithem yet 3)quick sort: using vector is too slow -> need some optimizations on vector approach 4)hybird quick sort: in a particular depth (or size < CONST, expr) stop sort and just search (O(n^2)) 5)[?] use a hybird sort with merge sort or Pythons hybird search: look for sorted sublists