A sort implementation comparing with Bubble sort and Selection sort

Today implementation of sort leads to lower and easier order time. Our purpose in this article are trying to introduce an algorithm with lower cost of Bubble sort and nearly same as Selection sort. A way is in orderly inserting of elements in another array. Sort is an algorithm that arranges all elements of an array, orderly. This algorithm has sequential form. The order of Selection sort complexity is nearly least than Bubble sort.