Sorting Algorithms In Brief

-

This article is a brief description of some set of widely used sorting techniques and it's implementations in golang.

Summary:

  1. Insertion Sort
  2. Selection Sort

Insertion Sort

This algorithm maintains a sorted portion and unsorted portion, in the given list of elements to be sorted.

It picks a corner element from unsorted portion and inserts it into correct location in the sorted portion.

Here is the golang implementation of insertion sort.

Run in Go Playground

Here the algorithm sorts the elements in ascending order.

The outer for loop, scan the array from start to end. ( with itr iterator.)

The left portion pointed by outer for loop iterator will be the sorted portion.

On every iteration of outer for loop, inner for loop shift the element pointed by outer iterator to its correct locations.

This has been achieved by continuous comparison (arr[inItr] < arr[inItr-1]) and swapping.

Selection Sort

Similar to insertion sort, selection sort also maintains a sorted and unsorted portion in the given list.

Selection sort picks smallest element among unsorted portion and grows sorted portion on iteratively.

Run in Go Playground

The outer loop tracks the sorted portion and inner loop finds index of smallest element from the unsorted portion.

Comments

Post a Comment

Popular posts from this blog

Theory of Computation | Symbols, Alphabets, Strings and Language

-
Theory of computation or Automata theory mainly deals with abstract modeling of machines and computation. These models embody some of the important complex logical features we encounter, on dealing software as hardware. The following are the basic terminologies, which are frequently used in Theory of Computation Symbol The smallest building entity of Automata Theory( or Theory of Computation) is known as symbol. example: a, 2, i, B... Alphabet A set of symbols forms an alphabet. An alphabet is usually represented by Greek letter sigma( Σ ) example: Σ= { x, y} String A string is a sequence of symbols in a alphabet. example: 'xy' is a string derived from the alphabet Σ= { x, y} Language Collection of strings are called as a language. example: Let an alphabet Σ= { p, q, r} Then if a language L of set of a strings of length 2 over Σ can be represented as L = { pp, pq, pr, qp, qq, qr, rp, rq, rr } ...
Next »

Operating Systems | Types and Functions

-
Image
An operating system is an interface between user and hardware of a system and it controls allocation of resources and its retrieval. The major functions of operating systems are Dynamic handling of available/allocated/free spaces of memory. Controlling of process state transitions efficiently. Maintaining of consistency in resource access by different processes synchronization methods. incorporation of protection and security in the system. The main objectives of an operating systems to, to provide convenient interface to its users and it should be efficient to process complex scientific data. The fundamental operations of an OS can be described as follows: Synchronization of processes What ever you do on your system is a process. Let us say your sending a request to your printer from a word document when your printe...
Next »

Computer Network | Flow control Methods: Stop and Wait

-
Image
Some times sending data packets at higher rate to a less efficient receiver may cause for the discarding of data from the buffer and lead to data loss. Flow control methods are used to avoid this dilemma. Stop and Wait When the data packet from the sender reaches at the receiver it returns a success message and once the sender acknowledges the success return it will go for the the next one. This sequence of protocols are know as stop and wait method of flow control. In theoretical questions T q and T process usually approximates as zero. Generally Transmission delay for the acknowledgement will be negligibly small (about 10 -3 times) compared to transmission delay for the data,which may also can approximate to zero. Piggybacking is a concept where data is send along with acknowledgment and other control information during bidirectional communication. So in Piggybacking acknowledgement time will become equal to that of propagation transmission time. Cases where T ac...
Next »