My study notes 2

rename.sh

# https://stackoverflow.com/questions/7992689/how-to-loop-over-files-in-natural-order-in-bash
# https://stackoverflow.com/questions/3211595/renaming-files-in-a-folder-to-sequential-numbers

readarray -d '' entries < <(printf '%s\0' *.png | sort -zV)
num=10846
for entry in "${entries[@]}"; do
  new=$(printf "%07d.png" "$num") #07 pad to length of 7
  mv -i -- "$entry" "$new"
  echo "${entry} -> ${new}"
  let num=num+1
done

sorter_pattern.cpp

#include <iostream>
#include <vector>
using namespace std;

class MySorter {
public:
    virtual ~MySorter() {  }
    virtual void thucHien(vector<int> &a, bool tangDan = true) {
        if (tangDan) thucHien(a, MySorter::soSanhTangDan);
        else thucHien(a, MySorter::soSanhGiamDan);
    }

protected:
    static bool soSanhTangDan(int x, int y) { return x > y; }
    static bool soSanhGiamDan(int x, int y) { return x < y; }
    virtual void thucHien(vector<int> &a, bool (*soSanh)(int, int)) = 0;
};

class MyInterchangeSorter: public MySorter {
public:
    void thucHien(vector<int> &a, bool (*soSanh)(int, int)) {
        for (int i = 0; i < a.size(); ++i)
            for (int j = i + 1; j < a.size(); ++j)
                if (soSanh(a[i], a[j])) {
                    int tam = a[i];
                    a[i] = a[j];
                    a[j] = tam;
                }
    }
};

class MyBubbleSorter: public MySorter {
public:
    void thucHien(vector<int> &a, bool (*soSanh)(int, int)) override {
        for (int i = 0; i < a.size(); ++i)
            for (int j = i + 1; j < a.size(); ++j)
                if (soSanh(a[j - 1], a[j])) {
                    int tam = a[i];
                    a[i] = a[j];
                    a[j] = tam;
                }
    }
};

class DanhSach {
private:
    vector<int> data;

public:
    void nhap() {
        int n = 0;
        cout << "Nhap so luong phan tu: ";
        cin >> n;

        data.resize(n);
        for (int i = 0; i < n; ++i)
            cin >> data[i];
    }

    void hienThi() {
        for (int &value: data)
            cout << value << "  ";
        cout << endl;
    }

    void sapXep(MySorter *sorter, bool tangDan = true) {
        sorter->thucHien(data, tangDan);
    }
};

int main() {
    DanhSach ds;
    ds.nhap();
    ds.hienThi();

    ds.sapXep(new MyInterchangeSorter());
    ds.sapXep(new MyBubbleSorter());
    return 0;
}

Why deep representations?

The edges in this picture are grouped together with pixels to form edges. It can then detect the edges and group edges together to form parts of faces	To compute XOR, the depth of the network will be on the order of log(N). We'll just have an XOR tree. So the number of nodes/circuit components/gates is not that large. If you're forced to compute this function with just 1 hidden layer -> This hidden layer will be exponentially large in the number of bits, because you need to exhaustively enumerate our 2^N possible configurations