代码拉取完成,页面将自动刷新
package chapter13;
public class numberList {
private numberNode list;
public numberList()
{
list =null;
}
public void add(number num)
{
numberNode node = new numberNode(num);
numberNode current;
if(list==null)
list=node;
else
{
current = list;
while(current.next!=null)
current=current.next;
current.next=node;
}
}
public String toString()
{
String result="";
numberNode current=list;
while(current != null)
{
result+= current.num+ "\n";
current=current.next;
}
return result;
}
public void selectionSort()
{
numberNode min,current=list ;
number tem;
while(current!=null)
{
min=current;
numberNode current2=current.next;
while(current2!=null)
{
if (min.num.getNum()>current2.num.getNum())
min =current2;
current2=current2.next;
}
tem=min.num;
min.num=current.num;
current.num=tem;
current=current.next;
}
}
public class numberNode
{
public number num;
public numberNode next;
//--------------------------------------------------
//Sets up the node.
//--------------------------------------------------
public numberNode(number num)
{
this.num =num;
next=null;
}
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。