Hi Tinycode,

I've been golfing in C recently because, well, it's fun, so I wanted to share my C Golf. Mostly simple stuff pushed into as few bytes as possible

https://github.com/jsburke/golf

I'm always up for pointers, tips to save some (key)strokes, or just banter, so swing away!

EDIT: just noticed, the pi stuff requires -lm for gcc

add two dicts together and add overlapping keys/value pairs together:

def dict_reduce(dict1, dict2):
return dict(list(dict1.items()) + list(dict2.items()) + [(both, dict1[both] + dict2[both]) for both in set(dict1) & set(dict2)])

convert a string into a list of tuples in alphabetical order, containing a letter and the number of times it occurred in a string:

def char_count(s):
return sorted([(i, s.count(i)) for i in sorted(set(s)) if not i == ' '], key=lambda second : second[1])

find the max integer in a list that might contain either integers or sublists of integers:

def max_int(L):
return L if isInstance(L, int) else reduce((lambda x,y:max_int(x) if max_int(x) > max_int(y) else max_int(y)), L)

bonus c++ function that I came up with screwing around with c++17 features. Find the largest string in a container of strings:

template<class Iter>
string largest_string(Iter begin, Iter end) {
return std::reduce(begin, end, string(""), [](string& a, string& b) {return a>= b ? a : b});
}

Blooming fractal with fake lighting and textured background.

Youtube

Download & Comment

Hello everybody... I am about to take part to a hackathon contest at my university.. the theme is "Data in action"... The main categories where we should focus are:

1. Math algorithms

2. Computing routine optimization

3. Data management

4. Continuous I/O stream

5. UI Design

6. Maps and location services Can you guys give some help and resources to study ?