apple平哥

摘要： type_synonym string ="char list" datatype 'a tree = Tip | Node "'a tree" 'a "'a tree" fun mirror :: " 'a tree ⇒ 'a tree" where"mirror Tip = Tip"|" mir 阅读全文

摘要： [] is Nil x # xs is Cons x xs [x1,...xn ] is x1#....#xn#[] xs@ys is app xs ys fun length::" 'a list =>nat" where "length Nil = 0"|"length (Cons x xs) 阅读全文

摘要： theory Toylist imports Mainbegindeclare [[names_short]]no_notation Nil ("[]") and Cons (infixr "#" 65) and append (infixr "@" 65)datatype 'a list = Ni 阅读全文

摘要： declare [[names_short]] datatype bool = True|False (if b then t1 else t2) (let x = t in u) (case t of pat1=>t1|...|patn=>tn) A1=>A2=>A3=>...=>An=>A <= 阅读全文

摘要： var game = new Phaser.Game(800, 600, Phaser.AUTO, 'phaser-example', { preload: preload, create: create, update: update }); function preload() { game.l 阅读全文

摘要： 你要坚信每天叫醒你的不是闹钟，而是心中的梦想。 阅读全文

摘要： 设函数fx在区间[a,b]上连续，由定积分中值公式有∫(a,x) f(t)dt =(x-a)f(m) (a<=m<=x<b) ∫(a,x)表示上限是x下限是a若导数f'+(a)存在且非零 求lim(m-a)/(x-a);(这里是x趋向于a+)结果为0.5 阅读全文

摘要： #include #include #include #include #include using namespace std;template int one(int first,int end,T r[]){int i,j,t;i=first,j=end;while(i>n;for(i=0;i... 阅读全文

摘要： #include using namespace std;void xier(int r[],int n){ int d,i,j; for(d=n/2;d>=1;d=d/2){ for(i=d+1;i0&&r[0]<r[j];j=j-d) r[j+d]=r[j]; r[j+d]=r[0]... 阅读全文

摘要： #include using namespace std;void reverse(int r[],int first,int end){ int i,n=end-first+1,t; for(i=0;i<n/2;i++){ t=r[first+i]; r[first+i]=r[end-i]; ... 阅读全文