Math
__BMGT()
___
展开
-
Godot 线性插值
interpolation = A * (1 - t) + B * tinterpolation = A + (B - A) * tposition = $A.position.linear_interpolate($B.position, t)用线性插值得到二次贝塞尔曲线func _quadratic_bezier(p0: Vector2, p1: Vector2, p2: Vector2, t: float): var q0 = p0.linear_interpolate(.转载 2022-05-02 15:38:21 · 421 阅读 · 0 评论 -
Math Vector Product Note
转载 2022-04-27 18:13:17 · 102 阅读 · 0 评论 -
Go 仿SQL解析
仿SQL结构:<begin statement> begin [isolation level (read committed|repeatable read)] begin isolation level read committed<commit statement> commit<abort statement> abort<create statement> create table &转载 2020-10-16 17:01:33 · 315 阅读 · 0 评论 -
three.js scene,camera,renderer ,spotlight,shadow
<!DOCTYPE html><html><head> <meta charset="UTF-8"> <title>Basic</title></head><body> <h1>Base</h1> <script type="text/javascr...原创 2020-01-04 16:28:05 · 266 阅读 · 0 评论 -
JavaScript 10进制大整数四则运算:加 减 乘 除
var digits = [ '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's',...原创 2019-12-01 18:08:21 · 573 阅读 · 0 评论 -
Binary Insertion Sort Test
#include"MyOutput.hpp"/** * 二分插入排序,将已经排好序的数组,按二分法 * 比较大小,最终确定left == 子区间中间点(最后确定的点)索引. * a[left] > x (要插入的点) * * */ template<typename T>void BinaryInsertionSort(T a[],int len){ ...转载 2018-03-23 21:00:17 · 252 阅读 · 0 评论 -
Insertion Sort Test
#include"MyOutput.hpp"template<typename T>void insertionSort(T t[],int len){ // println(typeid(t).name()); for(int i=1;i<len;i++){ T tmp = t[i]; // The following c...原创 2018-03-19 22:19:28 · 229 阅读 · 0 评论 -
Selection Sort Test
#include"MyOutput.hpp"#include<vector>template<typename T>void selectionSort(T t[],int len){ for(int i=0;i<len;i++){ int minIdx = i; for(int j=i+1;j<len;j++){...原创 2018-03-19 21:26:53 · 205 阅读 · 0 评论 -
Merge Sort (Recursion) Test
#include"MyOutput.hpp"template<typename T>void MergeSortedArray(T a[],int alen,T b[],int blen){ T *t = new T[alen+blen]; int i = 0; int j = 0; int k = 0; while(i < a...转载 2018-03-22 21:58:32 · 233 阅读 · 0 评论 -
Random Quick Sort Test
#include"MyOutput.hpp"template<typename T>int partition(T a[],int p,int r){ T x = a[p];//将首元素设置为哨兵 int i=p+1;//从首元素的下个元素开始比较 int j=r; //这里先++i,++j增(减)再比,很重要 wh...原创 2018-03-22 20:16:30 · 397 阅读 · 0 评论 -
Quick Sort Test
#include"MyOutput.hpp"template<typename T>int partition(T a[],int p,int r){ T x = a[p];//将首元素设置为哨兵 int i=p+1;//从首元素的下个元素开始比较 int j=r; //明白算法的大致思想,但要实现算法的时候,注意实现代码,这...原创 2018-03-22 19:54:10 · 186 阅读 · 0 评论 -
Heap Sort Test
#include"MyOutput.hpp"template<typename T>int idxMax(T a[],int i,int j){ return a[i] > a[j]?i:j;}template<typename T>void MyAdjustHeap(T a[],int len){ int lastNonLeafNod...转载 2018-03-24 01:24:09 · 162 阅读 · 0 评论 -
Shaker Sort Test (鸡尾酒排序)
#include"MyOutput.hpp"template<typename T>void MyShakerSort(T a[],int len){ int i=0; int j=len-1; while(i<j){ //max ,min1,min2,min3 //==> min1,min2,min3,max...原创 2018-03-24 17:22:58 · 409 阅读 · 0 评论 -
Counter Sort Test
#include"MyOutput.hpp"template<typename T>void CounterSort(T a[],int len){ int max = 0; for(int i=0;i<len;i++){ if(a[i] > max){ max = a[i]; } }...转载 2018-03-24 19:59:39 · 205 阅读 · 0 评论 -
Shell Sort Test
#include"MyOutput.hpp"template<typename T>void ShellSort(T t[],int len){ int insertNum; int gap = len/2; while(gap > 0){ /** * 从后往前i = gap,i++,i<len;t[j-gap...转载 2018-03-21 16:19:49 · 153 阅读 · 0 评论 -
查询不满足条件并且平均值最大的那个数据
example : 查询 学生中 某科目 不及格, 平均分数 最大 的学生:create table student(id number primary key,name varchar2(10),subject varchar2(20),score number);select * from user_tables;select abs(mod(dbms_random.rando...原创 2018-03-26 14:37:01 · 246 阅读 · 0 评论 -
CUDA user-defined dim3
#include<stdio.h>#include<stdlib.h>#include<conio.h>typedef unsigned int * const uipc;typedef const unsigned int cui;typedef unsigned int ui;__global__ void what_is_my_id_2d_...转载 2018-04-15 14:51:17 · 769 阅读 · 0 评论 -
Java NIO2 -- AIO Callable -- Future
package com.xiuye.nio;import java.io.IOException;import java.net.InetSocketAddress;import java.net.StandardSocketOptions;import java.nio.ByteBuffer;import java.nio.CharBuffer;import java.nio.ch...转载 2018-04-15 18:38:38 · 419 阅读 · 0 评论 -
5W2H 是什么?
七问分析法转载 2019-09-05 14:06:36 · 1516 阅读 · 0 评论 -
Longest Palindromic Substring (最长回文串)
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.Example:Input: "babad"Output: "bab"Note: "aba" is also a valid answer. Exa...转载 2018-03-18 23:43:52 · 184 阅读 · 0 评论 -
Median of Two Sorted Arrays(not optimized)
There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).Example 1:nums1 = [1, 3]...原创 2018-03-17 20:33:33 · 193 阅读 · 0 评论 -
平面弧长极坐标公式的疑问
参考(2)为什么正确转载 2017-07-24 16:30:57 · 3313 阅读 · 1 评论 -
求球体的表面积和体积
原创 2017-07-09 19:11:10 · 6606 阅读 · 0 评论 -
定积分的近似计算方法
矩形法:(左中右)梯形法:抛物线法:(ax^2+bx+c)转载 2017-06-24 22:37:50 · 6389 阅读 · 0 评论 -
拉格朗日乘数法 对y的偏导数的推导 (有点牵强,作为理解吧)
Fy - Fy =0lambda = - Fy / GyFy - Fy / Gy * Gy =0Fy + lambda * Gy = 0接下来就可以整合了x y 的通式.H(x , y ) = F(x , y ) + lambda * G(x , y)原创 2017-05-16 15:12:17 · 3447 阅读 · 0 评论 -
行列式计算方法(1)
原创 2017-05-03 18:24:34 · 4487 阅读 · 0 评论 -
二重积分极坐标变换
公式证明参考这里另一种证明:转载 2017-07-24 17:10:50 · 25546 阅读 · 1 评论 -
Dubble Sort Test
#include"MyOutput.hpp"template<typename T>void swap(T *t1,T *t2){ T t = *t1; *t1 = *t2; *t2 = t;}template<typename T>void dubble_sort_optimized(T *t,int len){//effect not...原创 2018-03-17 14:44:43 · 395 阅读 · 0 评论 -
线性同余随机数算法简单地实现
#include<iostream>#include<ctime>#include"MyOutput.hpp"using namespace std;static unsigned int a = 17;static unsigned int b = 139;static const unsigned long BASE_VALUE = ULONG_MAX;/...原创 2018-03-11 01:59:04 · 1213 阅读 · 0 评论 -
3Sum
Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note: The solution set must not contain dup...转载 2018-03-15 20:41:56 · 148 阅读 · 0 评论 -
Longest Substring Without Repeating Characters (not optimized)
Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "b", with...原创 2018-03-15 20:38:53 · 138 阅读 · 0 评论 -
Add Two Numbers(not optimized)
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return i...原创 2018-03-15 20:35:41 · 198 阅读 · 0 评论 -
Two Sum(not optimized)
Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the same ...原创 2018-03-15 20:33:39 · 172 阅读 · 0 评论 -
重要的反常积分证明
转载 2017-04-29 17:48:06 · 19518 阅读 · 0 评论