/*引導排序列表*/
select * from explanation_file_recommendation
order by orders desc
/*向下*/
select top 1 *
from explanation_file_recommendation
where (orders < 5)
order by orders desc
/*向上*/
select top 1 *
from explanation_file_recommendation
where (orders > 10)
order by orders
using system;
using system.collections;
using system.componentmodel;
using system.data;
using system.drawing;
using system.web;
using system.web.sessionstate;
using system.web.ui;
using system.web.ui.webcontrols;
using system.web.ui.htmlcontrols;
using system.data.sqlclient;
namespace datagridtest
#endregion
private void updataorders(float a)//這是向上翻
private int uprfloat(float float1)//向上id
private void downdataorders(float a1)//這是向下翻
private int downrfloat(float float2)//向下id
public void owndelete(int id)
private int fromordersfindid(float orders)
private float fromidfindorders(int id)
private void datagrid1_itemcommand_1(object source, system.web.ui.webcontrols.datagridcommandeventargs e)
if(e.commandname=="diadown")
if(e.commandname == "delete")
if(e.commandname=="taketotop")
if(e.commandname=="taketolast")
if(e.commandname=="timeset")}}
private float remaxorders()
private void updatebecomefirst(float a,float b)
private float reminorders()
private void downdatebecomelast(float a,float b)
private void btnfirst_click(object sender, system.eventargs e)
}town=float.parse(sid);
needmove=remaxorders();
updatebecomefirst(town,needmove);
}catch(system.exception ex)
finally
}private void btnlast_click(object sender, system.eventargs e)
}town=float.parse(sid);
needmove=reminorders();
downdatebecomelast(town,needmove);
databinddatagrid();
}private void btntisub_click(object sender, system.eventargs e)
private void updatetime(int fl,string a,string b)
public void showalert(string content)
private void btntican_click(object sender, system.eventargs e)
private void datagrid1_itemcreated(object sender, system.web.ui.webcontrols.datagriditemeventargs e)
}public float fileid
}set
}public int diaid
}set}}
}
常見排序列表
中文名稱 英文名 稱 平均時間複雜度 最壞時間複雜度 最好時間複雜度 空間複雜度 穩定性選擇排 序 selection n n n21 不穩氣泡排序 bubble n n n1 穩插入排序 insertion n n n1 穩堆排序 heap nlog2n nlog2n nlog2n1不穩 希爾排序...
23 合併多個排序列表 C 思路
分治的思路很好想 也比較好理解 listnode mergelist listnode a,listnode b else listnode merge vector lists,int l,int r listnode mergeklists vector lists 官方給的優先佇列思路很精妙 ...
排序列表轉換為二分查詢樹
開始接觸鍊錶問題。從朋友那得到指導，喚醒了以前的記憶，鍊錶還是手動加上head比較好處理。返回的時候返回head next比較好。此題用遞迴即可，快慢指標的應用，可以找到鍊錶中點，如果不用手動加head的方法處理起來就異常艱難。另外遞迴也好久沒寫遺忘了。寫一下備忘。第一次寫的時候 slow next...