<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wang_0712的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wang_0712</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wang_0712]]></copyright><item><title><![CDATA[FFT算法的完整DSP实现]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80543801</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80543801</guid><author>wang_0712</author><pubDate>Fri, 01 Jun 2018 22:55:24 +0800</pubDate><description><![CDATA[FFT算法的完整DSP实现 
DFT计算X(k)需要N^2次复数乘法和N(N-1)次复数加法 
FFT算法的流程图如下图，总结为3过程3循环： 
（1）3过程：单点时域分解（倒位序过程） + 单点时域计算单点频谱 + 频域合成 
（2）3循环：外循环——分解次数，中循环——sub-DFT运算，内循环——2点蝶形算法 
 
分解过程或者说倒位序的获得参考下图理解： 
 
 FFT的DSP实现

下面...]]></description><category></category></item><item><title><![CDATA[C语言操作符]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80490190</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80490190</guid><author>wang_0712</author><pubDate>Thu, 31 May 2018 11:49:14 +0800</pubDate><description><![CDATA[操作符

算数操作符，移位操作符，位操作符，赋值操作符，单目操作符，关系操作符，逻辑操作符，条件操作符和逗号表达式。下面就是关于操作符大概的总结。...]]></description><category></category></item><item><title><![CDATA[在屏幕上打印杨辉三角]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80490235</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80490235</guid><author>wang_0712</author><pubDate>Mon, 28 May 2018 23:18:06 +0800</pubDate><description><![CDATA[#include &amp;lt;stdio.h&amp;gt;
#define N 10
int main()
{
    int i;
    int j;
    int a[N][N];//数组为10行10列
    for (i = 0; i &amp;lt; N; i++)
    {
        a[i][0] = 1;//使第1列的元素值为1
        a[i][i] = 1;//使对角线的元素...]]></description><category></category></item><item><title><![CDATA[模拟实现strcat]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80474922</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80474922</guid><author>wang_0712</author><pubDate>Mon, 28 May 2018 08:10:57 +0800</pubDate><description><![CDATA[#include &amp;lt;stdio.h&amp;gt;  
#include&amp;lt;assert.h&amp;gt;  
#include&amp;lt;Windows.h&amp;gt;
char* my_strcat(char* dest, char* src)
{
    char *cp = dest;
    assert(src &amp;amp;&amp;amp; dest);
    while (*dest != '\0')...]]></description><category></category></item><item><title><![CDATA[模拟实现strcpy]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80473621</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80473621</guid><author>wang_0712</author><pubDate>Sun, 27 May 2018 22:29:52 +0800</pubDate><description><![CDATA[#include &amp;lt;stdio.h&amp;gt;  
#include&amp;lt;assert.h&amp;gt;  
#include&amp;lt;Windows.h&amp;gt; 
char *my_strcpy(char *dest, const char *src)
{
    char *cp = dest;
    assert(src &amp;amp;&amp;amp; dest);
    while (*dest){...]]></description><category></category></item><item><title><![CDATA[喝汽水，1瓶汽水1元，2个空瓶可以换一瓶汽水，给20元，可以多少汽水。编程实现]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80467530</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80467530</guid><author>wang_0712</author><pubDate>Sun, 27 May 2018 10:34:19 +0800</pubDate><description><![CDATA[
#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;stdlib.h&amp;gt;
int main()
{
    int money = 20;
    int count = 20;
    while (1)
    {
        if (money % 2 != 0)
        {
            count = count + money - 1...]]></description><category></category></item><item><title><![CDATA[一个数组中只有两个数字是出现一次，其他所有数字都出现了两次。  找出这两个数字，编程实现]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80465147</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80465147</guid><author>wang_0712</author><pubDate>Sat, 26 May 2018 21:21:49 +0800</pubDate><description><![CDATA[#include&amp;lt;stdio.h&amp;gt;  
Find_Num(int arr[], int sz, int * num1, int *num2)
{
    *num1 = 0;
    *num2 = 0;
    int i = 0;
    int ret = 0;
    int pos = 0;
    int temp = 0;
    for (i = 0; i &amp;lt; s...]]></description><category></category></item><item><title><![CDATA[模拟实现printf函数，可完成下面的功能]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80450037</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80450037</guid><author>wang_0712</author><pubDate>Fri, 25 May 2018 12:14:43 +0800</pubDate><description><![CDATA[//  
//能完成下面函数的调用。  
//print(“s ccc d.\n”,”hello”,’a’,’b’,’c’，100);  
//函数原型：  
//print(char *format, …)  
// 



#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;windows.h&amp;gt;
#include&amp;lt;stdarg.h&amp;gt;
void print(...]]></description><category></category></item><item><title><![CDATA[使用可变参数，实现函数，求函数参数的最大值]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80443451</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80443451</guid><author>wang_0712</author><pubDate>Thu, 24 May 2018 20:39:22 +0800</pubDate><description><![CDATA[
#include &amp;lt;stdio.h&amp;gt;  
#include &amp;lt;stdarg.h&amp;gt;    
int Max(int n, ...)
{
    int i = 0;
    int max = 0;
    va_list arg;
    va_start(arg, n);
    for (i = 0; i &amp;lt; n; i++)
    {
        int ...]]></description><category></category></item><item><title><![CDATA[使用可变参数，实现函数，求函数参数的平均值]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80438458</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80438458</guid><author>wang_0712</author><pubDate>Thu, 24 May 2018 17:39:56 +0800</pubDate><description><![CDATA[#include &amp;lt;stdio.h&amp;gt;
#include &amp;lt;stdarg.h&amp;gt;

int average(int n, ...)
{
    va_list arg;
    int i = 0;
    int sum = 0;
    va_start(arg, n);
    for (i = 0; i&amp;lt;n; i++)
    {
        sum += v...]]></description><category></category></item><item><title><![CDATA[递归和非递归分别实现求n的阶乘]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80433182</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80433182</guid><author>wang_0712</author><pubDate>Thu, 24 May 2018 13:30:39 +0800</pubDate><description><![CDATA[#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;windows.h&amp;gt;
int factorial(int n)
{
    if (n == 1)
    {
        return 1;
    }
    else if (n &amp;gt; 1)
    {
        n--;
        return (n + 1)*factorial(n);
  ...]]></description><category></category></item><item><title><![CDATA[递归和非递归分别实现strlen]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80429383</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80429383</guid><author>wang_0712</author><pubDate>Thu, 24 May 2018 08:56:07 +0800</pubDate><description><![CDATA[#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;windows.h&amp;gt;
int my_strlen(char *string)
{
    int count = 0;
    if (*string != '\0')
    {
        string++;
        count = 1 + my_strlen(string);
    }
    ret...]]></description><category></category></item><item><title><![CDATA[写一个递归函数DigitSum(n)，输入一个非负整数，返回组成它的数字之和]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80425714</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80425714</guid><author>wang_0712</author><pubDate>Wed, 23 May 2018 20:36:00 +0800</pubDate><description><![CDATA[写一个递归函数DigitSum(n)，输入一个非负整数，返回组成它的数字之和，例如，调用DigitSum(1729)，则应该返回1+7+2+9，它的和是19 

#include &amp;lt;stdio.h&amp;gt;  
#pragma warning(disable:4996)
int DigitSum(int n)
{
    int sum = 0;
    int m = 0;
    if (...]]></description><category></category></item><item><title><![CDATA[编写一个函数实现n^k，使用递归实现]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80423630</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80423630</guid><author>wang_0712</author><pubDate>Wed, 23 May 2018 17:50:16 +0800</pubDate><description><![CDATA[#include &amp;lt;windows.h&amp;gt;
#pragma warning(disable:4996)
int fun(int a, int b)
{
    if (b == 0)  
    {
        return 1;
    }
    else if (b == 1)
    {
        return a;
    }
    else
    {
     ...]]></description><category></category></item><item><title><![CDATA[递归和非递归分别实现求第n个斐波那契数]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80414526</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80414526</guid><author>wang_0712</author><pubDate>Wed, 23 May 2018 08:53:16 +0800</pubDate><description><![CDATA[递归实现

#include &amp;lt;stdio.h&amp;gt;  
#pragma warning(disable:4996)
int fib(int n)
{
    if (n &amp;lt;= 2)
        return 1;
    else
        return fib(n - 1) + fib(n - 2);
}
int main()
{
    int n = 0;
    ...]]></description><category></category></item><item><title><![CDATA[实现一个函数，可以左旋字符串中的k个字符]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80412735</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80412735</guid><author>wang_0712</author><pubDate>Tue, 22 May 2018 22:09:43 +0800</pubDate><description><![CDATA[ABCD左旋一个字符得到BCDA  
ABCD左旋两个字符得到CDAB 




#include &amp;lt;stdio.h&amp;gt;
void Left(char c[], int len, int k)  
{  
      k = k%len;
  int j = 0;  
  for (j=0; j&amp;lt;k; j++)  
  {  
      int i = 0;  
      ch...]]></description><category></category></item><item><title><![CDATA[判断一个字符串是否为另外一个字符串旋转之后的字符串]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80409680</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80409680</guid><author>wang_0712</author><pubDate>Tue, 22 May 2018 18:53:09 +0800</pubDate><description><![CDATA[例如：给定s1 ＝ AABCD和s2 = BCDAA，返回1，给定s1=abcd和s2=ACBD，返回0




#include &amp;amp;lt;stdio.h&amp;amp;gt;
#include &amp;amp;lt;windows.h&amp;amp;gt;
#include &amp;amp;lt;string.h&amp;amp;gt;

int judge(char str1[], char str2[])
{
    int i = 0;
    int j =...]]></description><category></category></item><item><title><![CDATA[调整数组使奇数全部都位于偶数前面]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80399348</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80399348</guid><author>wang_0712</author><pubDate>Tue, 22 May 2018 18:06:07 +0800</pubDate><description><![CDATA[输入一个整数数组，实现一个函数，来调整该数组中数字的顺序使得数组中所有的奇数位于数组的前半部分，所有偶数位于数组的后半部分。 



#include &amp;amp;lt;stdio.h&amp;amp;gt;  
#include &amp;amp;lt;stdlib.h&amp;amp;gt;  
void sort(int *a, int sz)
{
    int i = 0;
    int j = sz - 1;
    for (i = 0;...]]></description><category></category></item><item><title><![CDATA[使用函数实现两个数的交换]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80399224</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80399224</guid><author>wang_0712</author><pubDate>Mon, 21 May 2018 22:46:15 +0800</pubDate><description><![CDATA[    #include&amp;amp;lt;stdio.h&amp;amp;gt;
#include&amp;amp;lt;windows.h&amp;amp;gt; 
void swap(int *a, int *b)
{
    int tmp = 0;
    tmp = *a;
    *a = *b;
    *b = tmp;
}
int main()
{
    int a = 10;
    int b = 20;
    swap(&amp;amp;am...]]></description><category></category></item><item><title><![CDATA[写代码可以在整型有序数组中查找想要的数字，找到了返回下标，找不到返回-1.（折半查找）]]></title><link>https://blog.youkuaiyun.com/wang_0712/article/details/80366224</link><guid>https://blog.youkuaiyun.com/wang_0712/article/details/80366224</guid><author>wang_0712</author><pubDate>Mon, 21 May 2018 08:25:46 +0800</pubDate><description><![CDATA[#define _CRT_SECURE_NO_WARNINGS 1
#include&amp;amp;amp;lt;stdio.h&amp;amp;amp;gt;
#include&amp;amp;amp;lt;windows.h&amp;amp;amp;gt;


int Find(int X, int Y, int key, int *p)
{
    int mid = (X + Y) / 2;
    while ((X &amp;amp;amp;lt;= Y) &amp;amp;amp;amp;&]]></description><category></category></item></channel></rss>