Commit 4732a4b8 authored by MILIND NIRANJAN's avatar MILIND NIRANJAN

add basic implementation

parent 233cac56
#include <iostream>
#include <vector>
#include "sorting.h"
using namespace std;
vector<int> sort_custom(vector<int> a)
{
bool swapp = true;
while(swapp)
{
swapp = false;
for (int i = 0; i < a.size()-1; i++)
{
if (a[i]>a[i+1] )
{
a[i] += a[i+1];
a[i+1] = a[i] - a[i+1];
a[i] -=a[i+1];
swapp = true;
}
}
}
return a;
}
\ No newline at end of file
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment