单链表的排序

#include<iostream>#include<list>#include<string>#include<vector>using namespace std;template<class T>struct Node{T value;Node<T>* next;};template<class T>void sort(Node<T>* head){if(head==NULL) return;Node<T>* p,q;p = head;int len=0;while(p!=NULL){p=p->next;len++;}int i,j;for(i=0;i<len-1;i++){p = head;for(j=0;j<len-i-1;j++){if(p->value>p->next->value){T temp = p->value;p->value = p->next->value;p->next->value = temp;}p = p->next;}}}int main(){int a = 12;double q = static_cast<double>(a);printf("%f",q);}