Alfex4936

package csw;

import java.util.Random;

public class Quick {

    public static void main(String[] args) {
        Random rd = new Random();

        Double[] test = new Double[500_000];

Alfex4936

from bigO import bigO


class Comparator:
    def __init__(self):
        self.comparisons = 0

    def compare(self, a, b):
        self.comparisons += 1
        if a < b:

Alfex4936

class MTP:
    def __init__(self):
        # Coefficients
        self.a = 0x9908B0DF  # 2567483615
        self.b = 0x9D2C5680  # 2636928640
        self.c = 0xEFC60000  # 4022730752
        self.f = 1812433253
        self.l = 18
        self.m = 397
        self.n = 624

Alfex4936

from fastcore.all import *


class Node:
    def __init__(self, val, start=-1, end=-1):
        store_attr()

    def print(self):
        print(f"{self.val}: index from {self.start} to {self.end}.")

Alfex4936

from fastcore.utils import Self, L


if __name__ == "__main__":
    f = Self.sum()
    x = L(1, 2, 3)
    print(f(x))

    f = Self.map(lambda a: a + 1)
    x = L(1, 2, 3)

Alfex4936

static PyObject *python_bubblesort(PyObject *module, PyObject *arg)
{
  assert(arg);
  Py_INCREF(arg);

  if (!PyList_CheckExact(arg))
  {
    PyErr_SetString(PyExc_ValueError, "Argument is not a list.");
    goto except;
  }

Alfex4936

def bubbleSort(list array):
    return bubbleSort_c(array)

cdef bubbleSort_c(list array):
    cdef bint isSorted = False
    cdef int count = 0
    cdef Py_ssize_t i
    cdef Py_ssize_t n = len(array) - 1

    while not isSorted:

Alfex4936

// Tuples
int a = 1;
int b = 2;
(a, b) = (b, a);

Alfex4936

Alfex4936

class Node:
    __slots__ = ("key", "val", "prev", "next")

    def __init__(self, key, val):
        self.key = key
        self.val = val
        self.prev = None
        self.next = None