Selection Sort

The following is the basic code of Selection Sort algorithm:-
def selectionSort(l):
  for i in range(len(l)):
    minpos=i
    for j in range(i,len(l)):
      if l[j]<l[minpos]:
        minpos=j
    (l[i],l[minpos])=(l[minpos],l[i])
       
  return l
        

Comments

Post a Comment

Popular posts from this blog

Prime partitioning a number

Question:- A positive integer m can be partitioned as primes if it can be written as p + q where p > 0, q > 0 and both p and q are prime numbers. Write a Python function  primepartition(m)  that takes an integer  m  as input and returns  True  if  m  can be partitioned as primes and  False  otherwise. (If  m  is not positive, your function should return  False .) Here are some examples of how your function should work. >>> primepartition(7) True >>> primepartition(185) False >>> primepartition(3432) True Solution:- The idea behind the solution is that I'm computing all the prime numbers till the given number and appending to a list . Then I'm iterating over the list and subtracting it from the given number, if the subtracted value is prime then I'm returning True, otherwise after the loop ends returning False def primes (n): l = [] for i in range ( 2 ,n)...
Read more

Alternating prime and square

Question:- Write a Python function  squareprime(l)  that takes a nonempty list of integers and returns  True  if the elements of  l alternate between perfect squares and prime numbers, and returns  False  otherwise. Note that the alternating sequence of squares and primes may begin with a square or with a prime. Here are some examples to show how your function should work. >>> primesquare([4]) True >>> primesquare([4,5,16,101,64]) True >>> primesquare([5,16,101,36,27]) False Solution:- import math def prime_check (n): flag = 0 for i in range ( 2 ,n - 1 ): if n % i == 0 : flag = 1 if flag == 0 : return True else : return False def is_square (n): if math . sqrt(n) % 1 == 0 : return True else : return False def primesquare (l): flag = 0 if len (l) == 1 : if is_square(l[ 0 ]) or prime_check(...
Read more

Flip the matrix

Question. A two dimensional matrix can be represented in Python row-wise, as a list of lists: each inner list represents one row of the matrix. For instance, the matrix 1 2 3 4 5 6 7 8 9 would be represented as  [[1, 2, 3], [4, 5, 6], [7, 8, 9]] . A horizonatal flip reflects each row. For instance, if we flip the previous matrix horizontally, we get 3 2 1 6 5 4 9 8 7 which would be represented as  [[3, 2, 1], [6, 5, 4], [9, 8, 7]] . A vertical flip reflects each column. For instance, if we flip the previous matrix that has already been flipped horizontally, we get 9 8 7 6 5 4 3 2 1 which would be represented as  [[9, 8, 7], [6, 5, 4], [3, 2, 1]] . Write a Python function  matrixflip(m,d)  that takes as input a two dimensional matrix  m  and a direction  d , where  d  is either  'h'  or  'v' . If  d == 'h' , the function should return the matrix flipped horizontally. If  d ==...
Read more