O(N) is possible using Deque data structure. It holds pairs (Value; Index). at every step: if (!Deque.Empty) and (Deque.Head.Index <= CurrentIndex – T) then Deque.ExtractHead; //Head is too old, it is leaving the window while (!Deque.Empty) and (Deque.Tail.Value > CurrentValue) do Deque.ExtractTail; //remove elements that have no chance to become minimum in the window Deque.AddTail(CurrentValue, … Read more
lst = [{‘price’: 99, ‘barcode’: ‘2342355’}, {‘price’: 88, ‘barcode’: ‘2345566’}] maxPricedItem = max(lst, key=lambda x:x[‘price’]) minPricedItem = min(lst, key=lambda x:x[‘price’]) This tells you not just what the max price is but also which item is most expensive.
Code is tested with IE,FF,Chrome and works properly: var dates=[]; dates.push(new Date(“2011/06/25”)) dates.push(new Date(“2011/06/26”)) dates.push(new Date(“2011/06/27”)) dates.push(new Date(“2011/06/28”)) var maxDate=new Date(Math.max.apply(null,dates)); var minDate=new Date(Math.min.apply(null,dates));
There are likely to be many ways to accomplish this. My suggestion is to use Case/When to do it. With 3 columns, it’s not too bad. Select Id, Case When Col1 < Col2 And Col1 < Col3 Then Col1 When Col2 < Col1 And Col2 < Col3 Then Col2 Else Col3 End As TheMin From … Read more
The tersest expressive code to find the minimum value is probably rest parameters: const arr = [14, 58, 20, 77, 66, 82, 42, 67, 42, 4] const min = Math.min(…arr) console.log(min) Rest parameters are essentially a convenient shorthand for Function.prototype.apply when you don’t need to change the function’s context: var arr = [14, 58, 20, … Read more
Best: min(d, key=d.get) — no reason to interpose a useless lambda indirection layer or extract items or keys! >>> d = {320: 1, 321: 0, 322: 3} >>> min(d, key=d.get) 321
Recent manuals say: The G++ minimum and maximum operators (‘<?’ and ‘>?’) and their compound forms (‘<?=’) and ‘>?=’) have been deprecated and are now removed from G++. Code using these operators should be modified to use std::min and std::max instead. A quick search of the past documents seems to indicate that they were removed … Read more
Say that you have a list values = [3,6,1,5], and need the index of the smallest element, i.e. index_min = 2 in this case. Avoid the solution with itemgetter() presented in the other answers, and use instead index_min = min(range(len(values)), key=values.__getitem__) because it doesn’t require to import operator nor to use enumerate, and it is … Read more
How about something like: SELECT mt.* FROM MyTable mt INNER JOIN ( SELECT id, MIN(record_date) AS MinDate FROM MyTable GROUP BY id ) t ON mt.id = t.id AND mt.record_date = t.MinDate This gets the minimum date per ID, and then gets the values based on those values. The only time you would have duplicates … Read more
Where are MIN and MAX defined in C, if at all? They aren’t. What is the best way to implement these, as generically and type safe as possible (compiler extensions/builtins for mainstream compilers preferred). As functions. I wouldn’t use macros like #define MIN(X, Y) (((X) < (Y)) ? (X) : (Y)), especially if you plan … Read more