表插入排序 的英文怎麼說

中文拼音 [biǎochābèi]
表插入排序 英文
list insertion sort
  • : Ⅰ名詞1 (外面;外表) outside; surface; external 2 (中表親戚) the relationship between the child...
  • : 動詞1. (把細長或薄的東西放進、擠入、刺進或穿入; 插上; 插進) stick in; insert 2. (中間加進去; 加進中間去) interpose; insert
  • : Ⅰ動詞1 (進來或進去) enter 2 (參加) join; be admitted into; become a member of 3 (合乎) conf...
  • : 排構詞成分。
  • 插入 : insert; infix; run in; break in; patch; insertion; plug in; intercalate; intercalation; intromiss...
  • 排序 : collate
  1. Method of the map to get the map entries in insertion order

    方法來獲取按列的映射條目。
  2. Supports a second ordering option : maintaining the linked list in access order instead of insertion order

    支持第二種選項:按存取順而非維護鏈
  3. Super set of iemset x ) according to constrained subtree of itemset x, if item “ a ” isn ’ t a fuzzy item, we don ’ t scan database in addition. it can be generated by ffp tree. we propose two order methods for constructing ffp tree. one is that sorting database attributes holding frequent item in ascending order of their nodes number in ffp tree. another is that sorting frequent item of not fuzzy attributes in descending order of their support firstly, then sorting database fuzzy attributes with frequent item in ascending order of their nodes number in ffp tree. our experimental results show that although fmf needs more space costly than the algorithms based on apriori, its time costly is obviously lower than the latter

    針對ffp -樹的生成,提出了兩種方法:按屬性順將每個屬性下的頻繁項目依次到頭中,屬性按照其在ffp -樹中可能的不同結點的個數從少到多進行;先對非模糊屬性下的頻繁項目按支持度從大到小進行,再對模糊屬性按其在ffp -樹中包含的不同結點的個數,從少到多進行,然後依次將各屬性下的頻繁項目到頭中。
分享友人