skywatercomputer
码龄17年
求更新 关注
提问 私信
  • 博客:14,804
    14,804
    总访问量
  • 9
    原创
  • 2
    粉丝
  • 23
    关注
IP属地以运营商信息为准,境内显示到省(区、市),境外显示到国家(地区)
IP 属地:北京市
加入CSDN时间: 2008-03-17
博客简介:

skywatercomputer的专栏

查看详细资料
个人成就
  • 获得1次点赞
  • 内容获得3次评论
  • 获得0次收藏
  • 博客总排名2,005,957名
创作历程
  • 9篇
    2018年
成就勋章
TA的专栏
  • Thinking in Java 4th Edition
    1篇
  • algorithm
    5篇

TA关注的专栏 0

TA关注的收藏夹 0

TA关注的社区 0

TA参与的活动 0

创作活动更多

新星杯·14天创作挑战营·第13期

这是一个以写作博客为目的的创作活动,旨在鼓励大学生博主们挖掘自己的创作潜能,展现自己的写作才华。如果你是一位热爱写作的、想要展现自己创作才华的小伙伴,那么,快来参加吧!我们一起发掘写作的魅力,书写出属于我们的故事。我们诚挚邀请你们参加为期14天的创作挑战赛!注: 1、参赛者可以进入活动群进行交流、互相鼓励与支持(开卷),虚竹哥会分享创作心得和涨粉心得,答疑及活动群请见:https://bbs.csdn.net/topics/619781944 【进活动群,得奖概率会更大,因为有辅导】 2、文章质量分查询:https://www.csdn.net/qc

76人参与 去参加
  • 最近
  • 文章
  • 专栏
  • 代码仓
  • 资源
  • 收藏
  • 关注/订阅/互动
更多
  • 最近

  • 文章

  • 专栏

  • 代码仓

  • 资源

  • 收藏

  • 关注/订阅/互动

  • 社区

  • 帖子

  • 问答

  • 课程

  • 视频

搜索 取消

selection-sort

The core idea of the selection sort is to choose the minimum/maximum element from the remaining elements in the array, and then put it to the end of the elements that you have already sorted.The detai...
原创
博文更新于 2018.03.27 ·
173 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

flex4.5简单制作的柱图堆叠图饼图线图

发布资源 2012.10.25 ·
rar

eclipse集成jad插件

发布资源 2014.10.10 ·
zip

Radix sort

The whole idea is that we’re doing a digitby digit sort. We are going to do it from least significant to mostsignificant.         Let's think of here are n numbers and the numbers are binary, each int...
原创
博文更新于 2018.05.15 ·
680 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

Counting sort

         You can comprehend this problem from two different points of view.         Case 1: For an element x in an array, to check how many elements is less than x, after we got that message, we can p...
原创
博文更新于 2018.05.15 ·
358 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

heapsort

Heapsort is not a stable sort algorithm. In order to learn this algorithm, you need to know some concepts first.Actually, the heap is  binary tree, a parent node has two children nodes, the parent is ...
原创
博文更新于 2018.05.10 ·
304 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

quick sort and randomized quick sort

    The idea of classic quick sort is to divided the original array to two parts, and the when you doing the partition, you should make sure the element in left subarray always less than a pivot, and ...
原创
博文更新于 2018.05.04 ·
264 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

find largest sub array

There are two ways to solve the problem of largest sub array:1: divide-and-conquer method2: linear search methodNow let me introduce them one by one.1: divide-and-conquer methodThe core idea of it is ...
原创
博文更新于 2018.05.04 ·
246 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

merge-sort

Divide and conquer is the core idea of merge sort. You can recursively divide the original array into two sub-arrays, until each sub-array only has one element. At the last, it looks like a tree, the ...
原创
博文更新于 2018.03.28 ·
497 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

insertion-sort

The core idea of the insertion sort is to place an element in the appropriate location in the array.The detail steps of this algorithm are as follows:1.      Choose an element from left to right, and ...
原创
博文更新于 2018.03.27 ·
645 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

Welcomes like-minded people

As an old programmer, I am conscious of that I need to learn in depth, so I reorganized my blog. I’m going to learning some original English books. I would like to write an article after study per tim...
原创
博文更新于 2018.03.22 ·
310 阅读 ·
1 点赞 ·
0 评论 ·
1 收藏