7 Unexpected Code Hacks: No‑Code Deployment, Shuffle, Sleep Sort, AI One‑Liner & More

1. No‑Code Project

Repository: https://github.com/kelseyhightower/nocode (34 k stars). The project provides a lightweight, cross‑platform tool that automates deployment, compilation, packaging, installation, and execution without requiring source code changes. It demonstrates a fully automated workflow that can be invoked via command‑line scripts.

2. Shuffle Algorithm

Implementation of Fisher‑Yates shuffle that produces a uniformly random permutation of an array of n elements. Equivalent to Java’s Collections.shuffle():

for (int i = n - 1; i >= 0; i--) {
    // rand(0, i) generates a random integer in [0, i]
    swap(arr[i], arr[rand(0, i)]);
}

3. Sleep Sort

Demonstrates a sorting technique that creates one thread per element; each thread sleeps for a duration proportional to its value and then prints the value. The smallest value wakes first, producing sorted output.

public class SleepSort {
    public static void main(String[] args) {
        int[] ints = {1,4,7,3,8,9,2,6,5};
        SortThread[] sortThreads = new SortThread[ints.length];
        for (int i = 0; i < sortThreads.length; i++) {
            sortThreads[i] = new SortThread(ints[i]);
        }
        for (int i = 0; i < sortThreads.length; i++) {
            sortThreads[i].start();
        }
    }
}

class SortThread extends Thread {
    int ms;
    public SortThread(int ms) { this.ms = ms; }
    public void run() {
        try {
            // each thread sleeps ms*10 + 10 ms
            sleep(ms * 10 + 10);
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
        System.out.println(ms);
    }
}

Complexity: O(n) threads and O(maxValue) wall‑clock time; not suitable for large datasets.

4. One‑Line “AI” Core Code

Python loop that reads a line from stdin, removes the Chinese question particle “吗” and replaces the question mark “？” with an exclamation mark “！”, then prints the transformed text.

while True:
    print(input('').replace('吗','').replace('？','！'))

5. Get Tomorrow’s Timestamp

Java statement that pauses execution for exactly one day (86 400 000 ms):

Thread.sleep(86400L * 1000L);

6. The “0x5f375a86” Constant

The hexadecimal constant appears in the fast inverse square‑root algorithm (used in Quake III Arena). The core operation is: int i = 0x5f3759df - (i >> 1); Later analysis by Lomont derived a slightly different optimal constant ( 0x5f37642f) and a refined version ( 0x5f375a86). The algorithm provides an approximation of 1/√x that is faster than a full Newton‑Raphson iteration.

7. Hello World

Typical first program in any language, e.g.,

System.out.println("Hello World"); // Java