“Вставка сортировки” Ответ

вставка сортировки

def sortNumList(list1):
  x = len(list1)-1
  while True:
    index = 0
    while True:
      if list1[index] > list1[index+1]:
        get = list1[index], list1[index+1]
        list1[index+1], list1[index] = get
        # print(list1[index], list1[index+1])
        index +=1
        if index == x:
          break
          if(all(list1[i] <= list1[i + 1] for i in range(len(list1)-1))):
            break
            return list1
Clean Cow

вставка сортировки

*** Insertion sort ***
Enter some numbers : 1 2 3 4

[1, 2, 3, 4]
Data comparison =  3
Clumsy Corncrake

вставка сортировки

void insertion_sort ( int A[ ] , int n) 
{
     for(int i=1; i<n ;i++) {
      /*storing current element whose left side is checked for its correct position .*/
	  int temp = A[i];    
      int j = i-1;

      /* check whether the adjacent element in left side is greater or less than the current element. */
       while( j >= 0 && A[j] > temp) {
       // moving the left side element to one position forward.
            A[j+1] = A[j];   
            j--;
       }
       // moving current element to its  correct position.
       A[j+1] = temp;       
     }  
}
Lavish Garg

вставка сортировки

#include <bits/stdc++.h>

using namespace std; 

void insertionSort(int arr[], int n)  
{  
    int i, temp, j;  
    for (i = 1; i < n; i++) 
    {  
        temp = arr[i];  
        j = i - 1;  

        while (j >= 0 && arr[j] > temp) 
        {  
            arr[j + 1] = arr[j];  
            j = j - 1;  
        }  
        arr[j + 1] = temp;  
    }  
}

int main()  
{  
    int arr[] = { 1,4,2,5,333,3,5,7777,4,4,3,22,1,4,3,666,4,6,8,999,4,3,5,32 };  
    int n = sizeof(arr) / sizeof(arr[0]);  

    insertionSort(arr, n);  

    for(int i = 0; i < n; i++){
        cout << arr[i] << " ";
    }

    return 0;  
}
Glamorous Gibbon

вставка сортировки

 function insertionSortIterativo(array A)
     for i ← 1 to length[A] 
       do value ← A[i]
            j ← i-1
        while j >= 0 and A[j] > value 
          do A[j + 1] ← A[j]
             j ← j-1
        A[j+1] ← value;
Phil the ice cream man

Вставка сортировки

# Python program for implementation of Insertion Sort
 
# Function to do insertion sort
def insertionSort(arr):
 
    # Traverse through 1 to len(arr)
    for i in range(1, len(arr)):
 
        key = arr[i]
 
        # Move elements of arr[0..i-1], that are
        # greater than key, to one position ahead
        # of their current position
        j = i-1
        while j >= 0 and key < arr[j] :
                arr[j + 1] = arr[j]
                j -= 1
        arr[j + 1] = key
 
 
# Driver code to test above
arr = [12, 11, 13, 5, 6]
insertionSort(arr)
for i in range(len(arr)):
    print ("% d" % arr[i])
 
# This code is contributed by Mohit Kumra
Distinct Dragonfly

Вставка сортировки

public int[] insertionSort(int[] arr)
      for (j = 1; j < arr.length; j++) {
         int key = arr[j]
         int i = j - 1
         while (i > 0 and arr[i] > key) {
            arr[i+1] = arr[i]
            i -= 1
         }
         arr[i+1] = key
      }
      return arr;
Wrong Worm

вставка сортировки

 function insertionSortRicorsivo(array A, int n)
     if n>1
        insertionSortRicorsivo(A,n-1)
        value ← A[n-1]
        j ← n-2
        while j >= 0 and A[j] > value 
         do A[j + 1] ← A[j]
            j ← j-1
        A[j+1] ← value
Phil the ice cream man

Ответы похожие на “Вставка сортировки”

Смотреть популярные ответы по языку

Смотреть другие языки программирования

Shell/Bash
C#
C++
C
CSS
HTML
Java
JavaScript
Objective-C
PHP
Python
Sql
Swift
Ruby
TypeScript
Go
Kotlin
Assembly
R
VBA
Scala
Rust
Dart
Elixir
Clojure
Haskell
Matlab
Erlang
Cobol
Fortran
Scheme
Perl
Groovy
Lua
Julia
Delphi
Abap
Lisp
Prolog
Pascal
ActionScript
Basic
Solidity
PowerShell
GDScript
Excel