maycuatroi1’s gists

maycuatroi1 / gist:4cc7d64eec68fa2e919559cfa49715d2

Last active February 6, 2026 07:01

[DeepSeek OCR 2] Pseudo-code from paper concept

	# Pseudo-code from paper concept
	class DeepEncoderV2:
	def forward(self, visual_tokens):
	# visual_tokens: [B, m, d] - m tokens, d=896 dim

	# Append learnable queries (same count as visual tokens)
	queries = self.learnable_queries # [n, d] where n = m
	combined = concat([visual_tokens, queries], dim=1) # [B, 2m, d]

	# Mixed attention: visual=bidirectional, queries=causal

maycuatroi1 / gist:1310b370c6764565f612b5f64c1cbda3

Last active February 6, 2026 07:01

Sample DeepSeek V2

	from transformers import AutoModel, AutoTokenizer
	import torch

	model_name = 'deepseek-ai/DeepSeek-OCR-2'

	tokenizer = AutoTokenizer.from_pretrained(model_name, trust_remote_code=True)
	model = AutoModel.from_pretrained(
	model_name,
	trust_remote_code=True,
	_attn_implementation='flash_attention_2',

maycuatroi1 / RSA 2048 sample

Created November 20, 2025 19:47

maycuatroi1 / RadixSort.java

Created October 26, 2025 22:52

	public class RadixSort {

	public static void radixSort(int[] arr) {
	if (arr.length == 0) {
	return;
	}

	// Find the maximum number to know number of digits
	int max = getMax(arr);

maycuatroi1 / BucketSort.java

Created October 26, 2025 22:51

	import java.util.ArrayList;
	import java.util.Collections;

	public class BucketSort {

	public static void bucketSort(int[] arr) {
	if (arr.length == 0) {
	return;
	}

maycuatroi1 / HeapSort.java

Created October 26, 2025 22:51

	public class HeapSort {

	public static void heapSort(int[] arr) {
	int n = arr.length;

	// Build max heap (rearrange array)
	for (int i = n / 2 - 1; i >= 0; i--) {
	heapify(arr, n, i);
	}

maycuatroi1 / BoubleSort.java

Last active October 26, 2025 22:49

	public class BubbleSort {

	public static void bubbleSort(int[] arr) {
	int n = arr.length;
	boolean swapped;

	for (int i = 0; i < n - 1; i++) {
	swapped = false;

	for (int j = 0; j < n - i - 1; j++) {

maycuatroi1 / MergeSort.java

Last active October 23, 2025 09:29

	// https://www.youtube.com/watch?v=WYrMGRJ9qFE

	public class MergeSort {

	// Gộp 2 mảng con đã được sắp xếp
	public static void merge(int[] arr, int left, int mid, int right) {
	// tính kích thước 2 mảng con
	int n1 = mid - left + 1; // Array trái
	int n2 = right - mid; // Array phải
	// Tạo mảng tạm

maycuatroi1 / MergeSort.java

Created October 23, 2025 07:18

	public class MergeSort {

	// Gộp 2 mảng con đã được sắp xếp
	public static void merge(int[] arr, int left, int mid, int right) {
	// tính kích thước 2 mảng con
	int n1 = mid - left + 1; // Array trái
	int n2 = right - mid; // Array phải
	// Tạo mảng tạm
	int[] L = new int[n1];
	int[] R = new int[n2];

maycuatroi1 / QuickSort.java

Last active October 23, 2025 09:30

	// https://www.youtube.com/watch?v=uf_DyA_Ku7A

	public class QuickSort {

	// Helper method để hoán đổi hai phần tử
	private static void swap(int[] arr, int i, int j) {
	int temp = arr[i];
	arr[i] = arr[j];
	arr[j] = temp;
	}

Nguyễn Anh Bình maycuatroi1