Python AI Big-O Analyzer

def recursive_sort(num_list): if len(num_list) <= 1: return num_list mid = int(len(num_list) / 2) left_part = recursive_sort(num_list[:mid]) right_part = recursive_sort(num_list[mid:]) return merge_sorted_lists(left_part, right_part)

async def async_call(): async with aiohttp.ClientSession() as session: async with session.get('http://httpbin.org/get') as resp: print(resp.status) return await resp.text()

SELECT name, COUNT(*) as orders FROM Customers INNER JOIN Orders ON Customers.CustomerID = Orders.CustomerID GROUP BY name HAVING COUNT(*) > 5 ORDER BY orders DESC;

def decor(func): def wrapper(): print('before call') func() print('after call') return wrapper @decor def print_text(): print('inside the function')

class Singleton(type): _instances = {} def __call__(cls, *args, **kwargs): if cls not in cls._instances: cls._instances[cls] = super(Singleton, cls).__call__(*args, **kwargs) return cls._instances[cls] class SingletonClass(metaclass=Singleton): pass

import pandas as pd df = pd.DataFrame({'A': ['John', 'Boby', 'Mina'], 'B': ['Masters', 'Graduate', 'Graduate'], 'C': [27, 23, 21]}) df.groupby('B').mean()

struct Node { int data; struct Node* next; }; void start_push(struct Node** head_ref, int new_data) { struct Node* new_node = (struct Node*) malloc(sizeof(struct Node)); new_node->data = new_data; new_node->next = (*head_ref); (*head_ref) = new_node; }

def fib(n): a, b = 0, 1 for _ in range(n): yield a a, b = b, a + b print(list(fib(10)))

class MyThread extends Thread { public void run(){ while(true){ System.out.println(Thread.currentThread().getId() + "Value-" + i); try{ Thread.sleep(1000); } catch (InterruptedException e){ e.printStackTrace(); } } } }

let promise = new Promise((resolve, reject) => { setTimeout(() => { resolve('Promise resolved')}, 5000); }) promise.then(value => console.log(value)).catch(error => console.log(error))