美文网首页
Selection Sort

Selection Sort

作者: GakkiLove | 来源:发表于2018-04-09 22:34 被阅读0次

Given an array of integers, sort the elements in the array in ascending order. The selection sort algorithm should be used to solve this problem.

Examples

{1} is sorted to {1}
{1, 2, 3} is sorted to {1, 2, 3}
{3, 2, 1} is sorted to {1, 2, 3}
{4, 2, -3, 6, 1} is sorted to {-3, 1, 2, 4, 6}

class Solution(object):
  def solve(self, array):
    if len(array) <= 1 :
      return array
    for n in range(len(array)-1,0,-1):
      largest_index = 0
      for j in range(n+1):
        if array[j] > array[largest_index] :
          largest_index = j
      array[n],array[largest_index] = array[largest_index],array[n]
    return array

相关文章

  • Algorithms

    BinarySearch Sort Selection sort Insertion sort

  • sorting algorithoms

    Bubble Sort Selection Sort Insertion Sort search : O(n) o...

  • 常见排序算法

    冒泡排序 Bubble Sort 选择排序 Selection Sort 计数排序 Counting Sort 桶...

  • Selection Sort

    Given an array of integers, sort the elements in the arra...

  • selection sort

    从第一个开始,找到序列中最小的,和第一个交换;然后从第二个开始,找到最小的和第二个交换……O(N*N) selec...

  • Selection Sort

    Selection Sort Supposing we have a unordered array nums. ...

  • Selection Sort

  • 排序算法之选择排序

    选择排序法(selection sort) 来自维基百科选择排序(Selection sort)是一种简单直观的排...

  • Algorithm learning: Selection So

    The selection sort algorithm sorts an array by repeatedly...

  • 排序经典算法

    冒泡算法(bubble sort) 选择排序(selection sort) 插入排序(insertion sor...

网友评论

      本文标题:Selection Sort

      本文链接:https://www.haomeiwen.com/subject/itmwhftx.html