sort tag

C# SORTING METHOD

Currently, I'm studying for C#.I've been asking questions about practice since I've never had it before.I'm stuck in sorting.Use the following code::1. Create a list for men only2. Create a list for w...

rewrite the quick sort using the stack

I'd like to rewrite the quick sort using the stack, but I'm not sure where and how to do itusing System;using System.Collections;classQueue_int:IEnumerable { int[]data; int max; int front, ba...

functions in python, questions about swap

*This is my first time asking a question, so I would appreciate it if you could accept it warmly.We created two functions min_index, selections as follows:j=min_index(A[i:]) A[i], A[i+j] = A[i+j], A[i...

Quick alignment using real numbers (C language)

#include <stdio.h>#include <stdlib.h> //Call random functionsvoidSwap (doublearr[], inta, intb) // a,b swap function { double temp = arr[a]; arr[a] = arr[b]; arr[b] = temp;}int Partition(d...

merge sort,quick sort rate question

While studying the algorithm, I compared the speed using the clock function by implementing the quick alignment and the merge alignment as cIn general, I knew that quick sorting performed better than ...

Python Nonrecursive Merge Alignment

def seq_merge_sort(arr): rght = 0; wid = 0; rend = 0; left = 0 k = 1 num = len(arr) temp = [0] * num while(k < num): while(left + k < num): rght = left + k rend = rght + k if(rend > num):...

String sorting

To import and sort Python text files into a list

Hong Gil-dong Computer 72Yi Sun-shin Electronics 50a heterogeneous computer 80When the data in the file is like this, The data structure is made of classes with names, departments, and creditsYou want...

To sort values by java Array size

package practice_3;import javax.swing.JOptionPane;public class ArrayExcercise1 {public static void main(String[]args) { int[] list = new int[10]; String print = ; for (int i = 0; i<list.length; i+...

I have a question about the bubble alignment of Python!

def sorting_list(list_a,sorting): for i in range(len(list_a)+1): for j in range(len(list_a)-i-1): if sorting==0: if list_a[j+1]>list_a[j]: tmp = list_a[j+1] list_a[j+1] = list_a[j] lis...