blob: bca7b02506140e07c1f2113d436633c80a6e503b (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
|
/* Copyright (C) 2016 - IIT Bombay - FOSSEE
This file must be used under the terms of the CeCILL.
This source file is licensed as described in the file COPYING, which
you should have received as part of this distribution. The terms
are also available at
http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
Author: Abhinav Dronamraju
Organization: FOSSEE, IIT Bombay
Email: toolbox@scilab.in
*/
#include "gsort.h"
#include "types.h"
#include "uint16.h"
void u16gsorta(uint16 *in, int size, char check, uint16* out)
{
uint16 a; uint16 fin; uint16 in_copy[size];
for(int i=0; i< size; i++)
{
in_copy[i]= in[i];
}
if(check == 'i')
{
for (int i = 0; i < size; ++i)
{
for (int j = i + 1; j < size; ++j)
{
if (in_copy[i] > in_copy[j])
{
a = in_copy[i];
in_copy[i] = in_copy[j];
in_copy[j] = a;
}
}
}
}
if(check =='d')
{
for (int i = 0; i < size; ++i)
{
for (int j = i + 1; j < size; ++j)
{
if (in_copy[i] < in_copy[j])
{
a = in_copy[i];
in_copy[i] = in_copy[j];
in_copy[j] = a;
}
}
}
}
for(int i=0; i< size; i++)
{
out[i]= in_copy[i];
}
}
|