mirror of
https://github.com/c0de-archive/hacktoberfest-2018.git
synced 2024-12-22 05:12:40 +00:00
Merge pull request #200 from HubbleJo/master
Added my name and a piece of code
This commit is contained in:
commit
849b2d0a96
14
README.md
14
README.md
@ -251,12 +251,10 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![facebook-alt][facebook-img]](https://facebook.com/arisdolanan)
|
||||
|
||||
### Arjun Rajpal
|
||||
|
||||
- Software Engineer and a ML Enthusiast
|
||||
- [![github-alt][github-img]](https://github.com/arjunrajpal)
|
||||
- Software Engineer and a ML Enthusiast
|
||||
- [![github-alt][github-img]](https://github.com/arjunrajpal)
|
||||
|
||||
### ASHKUSH
|
||||
|
||||
- Undergrad 2nd year CS student
|
||||
- Open Source contributor
|
||||
- [![github-alt][github-img]](https://github.com/ashkush21)
|
||||
@ -643,6 +641,13 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- Interests: Machine learning
|
||||
- [![github-alt][github-img]](https://github.com/longhai18)
|
||||
|
||||
### HubbleJo
|
||||
|
||||
- Student from Germany
|
||||
- Really likes Kotlin
|
||||
- Also interested in electronics and artificial Intelligence
|
||||
- [![github-alt][github-img]](https://github.com/hubblejo)
|
||||
|
||||
# I
|
||||
|
||||
### Icaro Lima
|
||||
@ -1551,7 +1556,6 @@ Please note that this project is released with a [Code of Conduct](CODE_OF_CONDU
|
||||
- [![github-alt][github-img]](https://github.com/uds5501)
|
||||
|
||||
### Uğur Soğukpınar
|
||||
|
||||
- Backend Developer
|
||||
- Interested in Machine Learning, Deep Learning, AI
|
||||
- [![github-alt][github-img]](https://github.com/ugursogukpinar)
|
||||
|
22
code/sort.js
Normal file
22
code/sort.js
Normal file
@ -0,0 +1,22 @@
|
||||
function (arr) {
|
||||
function swap(i, j) {
|
||||
let temp = arr[i];
|
||||
arr[i] = arr[j];
|
||||
arr[j] = temp;
|
||||
}
|
||||
let n = arr.length;
|
||||
let sw = true;
|
||||
let x = 0;
|
||||
while (sw) {
|
||||
sw = false;
|
||||
x = x + 1;
|
||||
for (let i = 1;i<=(n-x);i++) {
|
||||
if (arr[i - 1] > arr[i]) {
|
||||
swap(i - 1, i);
|
||||
sw = true;
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
return arr
|
||||
}
|
Loading…
Reference in New Issue
Block a user