-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtask.js
More file actions
80 lines (60 loc) · 1.75 KB
/
task.js
File metadata and controls
80 lines (60 loc) · 1.75 KB
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
const numbers = [5,8,0,1,9,11,15,16];
console.log("Original numbers list: ",numbers)
// replace i to j because i represent the iteration for the numbers
for(let i = 0 ; i < numbers.length ; i++)
{
for(let j = 0 ; j < numbers.length - 1 ; j++)
{
if(numbers[j] > numbers[j + 1])
{
let temp = numbers[j];
numbers[j] = numbers[j + 1]
numbers[j + 1] = temp;
}
}
}
console.log("numbers list After sorting: ",numbers)
// the same here replace i with j
for(let i = 0 ; i < numbers.length ; i++)
{
for(let j = 0 ; j < numbers.length - 1 ; j++)
{
if(numbers[j] < numbers[j + 1])
{
let temp = numbers[j];
numbers[j] = numbers[j + 1]
numbers[j + 1] = temp;
}
}
}
console.log("numbers list After Desc sorting: ",numbers)
// ------------------------------
// read data.txt file
var fs = require('fs');
fs.readFile('data.txt', 'utf8', function(err, data) {
if (err) throw err;
// store content of data.txt into variable
let newn = data.split(",");
// and sort it
for(let i = 0 ; i < newn.length ; i++)
{
for(let j = 0 ; j < newn.length - 1 ; j++)
{
if(newn[j] > newn[j + 1])
{
let temp = newn[j];
newn[j] = newn[j + 1]
newn[j + 1] = temp;
}
}
}
console.log("dataN list After sorting: ",(newn))
// create new txt file to store the sorted array in it
/*
here file.write(v+(',')) i should be file.write(v.join(','))
but it get error in windows so i make it like this "I KNOW IT'S WRONG" >_>
*/
var file = fs.createWriteStream('output.txt');
newn.map(function(v) { file.write(v+(',')); });
file.end();
});