测试Windows Live Writer编写博客，主要是代码格式

这里是代码，这是通过InsertCodeforWindowsLiveWriter.msi这个插件发布的：

#include<stdio.h>

#defineLEN5

inta[LEN]={10,5,2,4,7};

voidinsertion_sort(void)

{

inti,j,key;

for(j=1;j<LEN;j++){

printf("%d,%d,%d,%d,%d\n",

a[0],a[1],a[2],a[3],a[4]);

key=a[j];

i=j-1;

while(i>=0&&a[i]>key){

a[i+1]=a[i];

i--;

}

a[i+1]=key;

}

printf("%d,%d,%d,%d,%d\n",

a[0],a[1],a[2],a[3],a[4]);

}

intmain(void)

{

insertion_sort();

return0;

}

.csharpcode,.csharpcodepre
{
font-size:small;
color:black;
font-family:consolas,"CourierNew",courier,monospace;
background-color:#ffffff;
/*white-space:pre;*/
}
.csharpcodepre{margin:0em;}
.csharpcode.rem{color:#008000;}
.csharpcode.kwrd{color:#0000ff;}
.csharpcode.str{color:#006080;}
.csharpcode.op{color:#0000c0;}
.csharpcode.preproc{color:#cc6633;}
.csharpcode.asp{background-color:#ffff00;}
.csharpcode.html{color:#800000;}
.csharpcode.attr{color:#ff0000;}
.csharpcode.alt
{
background-color:#f4f4f4;
width:100%;
margin:0em;
}
.csharpcode.lnum{color:#606060;}

好了，不知道这次怎么样？希望没有什么问题

下面的代码是通过CodeSnippetpluginforWindowsLiveWriter这个插件发布的：

#include<stdio.h>

#defineLEN5

inta[LEN]={10,5,2,4,7};

voidinsertion_sort(void)

{

inti,j,key;

for(j=1;j<LEN;j++){

printf("%d,%d,%d,%d,%d\n",

a[0],a[1],a[2],a[3],a[4]);

key=a[j];

i=j-1;

while(i>=0&&a[i]>key){

a[i+1]=a[i];

i--;

}

a[i+1]=key;

}

printf("%d,%d,%d,%d,%d\n",

a[0],a[1],a[2],a[3],a[4]);

}

intmain(void)

{

insertion_sort();

return0;

}

下面的代码和上面的一样，只不过不使用容器，使用代码行：

[code]#include<stdio.h>

#defineLEN5

inta[LEN]={10,5,2,4,7};

voidinsertion_sort(void)

{

inti,j,key;

for(j=1;j<LEN;j++){

printf("%d,%d,%d,%d,%d\n",

a[0],a[1],a[2],a[3],a[4]);

key=a[j];

i=j-1;

while(i>=0&&a[i]>key){

a[i+1]=a[i];

i--;

}

a[i+1]=key;

}

printf("%d,%d,%d,%d,%d\n",

a[0],a[1],a[2],a[3],a[4]);

}

intmain(void)

{

insertion_sort();

return0;

}

[/code]
下面使用“代码插入插件”cf.SyntaxHighighter测试一下：

#include<stdio.h>

#defineLEN5
inta[LEN]={10,5,2,4,7};

voidinsertion_sort(void)
{
inti,j,key;
for(j=1;j<LEN;j++){
printf("%d,%d,%d,%d,%d\n",
a[0],a[1],a[2],a[3],a[4]);
key=a[j];
i=j-1;
while(i>=0&&a[i]>key){
a[i+1]=a[i];
i--;
}
a[i+1]=key;
}
printf("%d,%d,%d,%d,%d\n",
a[0],a[1],a[2],a[3],a[4]);
}

intmain(void)
{
insertion_sort();
return0;
}

下面使用PastefromVisualStudio来试一试：

#include<stdio.h>

#defineLEN5
inta[LEN]={10,5,2,4,7};

voidinsertion_sort(void)
{
inti,j,key;
for(j=1;j<LEN;j++){
printf("%d,%d,%d,%d,%d\n",
a[0],a[1],a[2],a[3],a[4]);
key=a[j];
i=j-1;
while(i>=0&&a[i]>key){
a[i+1]=a[i];
i--;
}
a[i+1]=key;
}
printf("%d,%d,%d,%d,%d\n",
a[0],a[1],a[2],a[3],a[4]);
}

intmain(void)
{
insertion_sort();
return0;
}