Wondering about sorting algorithm

[RUNNER PRO AGARIO]

I was coding my own sorting algorithm, and when I ran it, I was unsure what category it would fall into (Eg: Bubble Sort, Selection Sort, and so on). When I ran the program to see individual patterns, I could find none. Could someone explain what category my algorithm is? Here is my code:

#include <iostream>


//Custom swap function
template<typename T> void swap(T &a, T &b)
{
	T temp = b;
	b = a;
	a = temp;
}


int main()
{
	int array[5];

	std::cout << "Enter Five Integers: ";

	std::cout << "\n";
	for (int k = 0; k < 5; k++)
	{
		std::cout << "[" << k+1 << "] ";
		std::cin >> array[k];
	}
	std::cin.ignore();
	std::cout << "Array before Sorting: ";

	for (int l = 0; l < 5; l++)
	{
		std::cout << "[" << array[l] << "]";
	}

	std::cout << "\n";

	for (int i = 0; i < 5; i++)
	{
		int currentIndex = i;

		for (int j = i + 1; j < 5; j++)
		{
			if (array[currentIndex] > array[j])
			{
				swap(array[currentIndex], array[j]);
				for (int m = 0; m < 5; m++)
				{
					std::cout << "[" << array[m] << "]";
				}
				std::cout << "\n";
			}
		}
	}

	std::cout << "Array After Sorting: ";

	for (int o = 0; o < 5; o++)
	{
		std::cout << "[" << array[o] << "]";
	}
	std::cout << "\n";
	std::cin.get();
	
}

[Naughty Albatross]

> Could someone explain what category my algorithm is?

Bubble Sort

So you are here just to ask that? Is there a problem in your solution you are trying to deal with?

[RUNNER PRO AGARIO]

No, that was really it. And also, could you tell me how bubble sort works, because i must have misread about it since I already thought about that category?

[Arslan7041]

Watch this video here: https://www.youtube.com/watch?v=Jdtq5uKz-w4

[48T7M4Gy]

Surely if yours is a bubble sort, and I don't doubt it is, you know what a bubble sort is Runner?


(What's does this look like? ... It looks like a sausage. ... What does a sausage look like? ... Oh *this? ... What does this look like? .....)

[Duthomhas]

It is not a bubble sort.

This is a selection sort, without copy optimization.
(You copy every time you find a smaller value, instead of waiting to copy the smallest just once.)

Here's a pretty animation showing how it works:
http://www.cplusplus.com/faq/sequences/sequencing/sort-algorithms/selection-sort/

[RUNNER PRO AGARIO]

Ah, ok thanks Duoas, for the link. I get it now.

Annnd

@Kemort

...

[48T7M4Gy]

?