Skip to content

Commit ce1c4e6

Browse files
leiosleios
authored
Merge pull request #4 from Gathros/master
Adding JavaScript with HTML for presentation
2 parents 5f61038 + 17c996d commit ce1c4e6

File tree

2 files changed

+143
-2
lines changed

2 files changed

+143
-2
lines changed

‎chapters/computational_physics/verlet.md

+67-1
Original file line numberDiff line numberDiff line change
@@ -435,7 +435,7 @@ Submitted by P. Mekhail
435435

436436
#### C
437437

438-
```
438+
```c
439439
// Submitted by Gathros
440440
#include <stdio.h>
441441

@@ -502,3 +502,69 @@ int main(){
502502

503503
}
504504
```
505+
506+
### JavaScript
507+
508+
```html
509+
<!DOCTYPE html>
510+
<html>
511+
<body>
512+
<script>
513+
function verlet(pos, acc, dt){
514+
515+
var prev_pos, temp_pos, time;
516+
prev_pos = pos;
517+
time = 0;
518+
519+
while (pos > 0){
520+
time += dt;
521+
temp_pos = pos;
522+
pos = pos*2 - prev_pos + acc * dt * dt;
523+
prev_pos = temp_pos;
524+
}
525+
526+
return time;
527+
528+
}
529+
530+
function stormer_verlet(pos, acc, dt){
531+
532+
var prev_pos, temp_pos, time, vel;
533+
prev_pos = pos;
534+
vel = 0;
535+
time = 0;
536+
while (pos > 0){
537+
time += dt;
538+
temp_pos = pos;
539+
pos = pos*2 - prev_pos + acc * dt * dt;
540+
prev_pos = temp_pos;
541+
542+
vel += acc*dt;
543+
}
544+
545+
return time;
546+
547+
}
548+
549+
function velocity_verlet(pos, acc, dt){
550+
551+
var time, vel;
552+
vel = 0;
553+
time = 0;
554+
while (pos > 0){
555+
time += dt;
556+
pos += vel*dt + 0.5*acc * dt * dt;
557+
vel += acc*dt;
558+
}
559+
560+
return time;
561+
562+
}
563+
564+
document.write(verlet(5.0, -10, 0.01) + "<br>");
565+
document.write(stormer_verlet(5.0, -10, 0.01) + "<br>");
566+
document.write(velocity_verlet(5.0, -10, 0.01) + "<br>");
567+
</script>
568+
</body>
569+
</html>
570+
```

‎chapters/fundamental_algorithms/tree_traversal.md

+76-1
Original file line numberDiff line numberDiff line change
@@ -330,7 +330,7 @@ main()
330330

331331
### C
332332

333-
```C:
333+
```c
334334
// Submitted by Gathros
335335
#include <stdio.h>
336336
#include <stdlib.h>
@@ -597,3 +597,78 @@ namespace Tree_Traversal
597597
}
598598
}
599599
```
600+
601+
#### JavaScript
602+
603+
```html
604+
<!DOCTYPE html>
605+
<html>
606+
<body>
607+
<script>
608+
function create_tree(n, num_row, num_child){
609+
n.ID = num_row;
610+
n.children = [];
611+
if(num_row == 0){
612+
return;
613+
}
614+
615+
for(var i = 0; i < num_child; ++i){
616+
var child = new Object();
617+
create_tree(child, num_row - 1, num_child);
618+
n.children.push(child);
619+
}
620+
};
621+
622+
function DFS_recursive(n){
623+
document.write(n.ID + "<br>");
624+
if(n.children.length == 0){
625+
return;
626+
}
627+
for(var i = 0; i < n.children.length; ++i){
628+
DFS_recursive(n.children[i]);
629+
}
630+
}
631+
632+
function DFS_stack(n){
633+
var s = [];
634+
s.push(n);
635+
var temp;
636+
637+
while(s.length > 0){
638+
temp = s.pop();
639+
document.write(temp.ID + "<br>");
640+
for(var i = 0; i < temp.children.length; ++i){
641+
if(temp.children.length == 0){
642+
break;
643+
}
644+
s.push(temp.children[i]);
645+
}
646+
}
647+
}
648+
649+
function BFS_queue(n){
650+
var q = [];
651+
q.push(n);
652+
var temp;
653+
654+
while(q.length > 0){
655+
temp = q.shift();
656+
document.write(temp.ID + "<br>");
657+
for(var i = 0; i < temp.children.length; ++i){
658+
if(temp.children.length == 0){
659+
break;
660+
}
661+
q.push(temp.children[i]);
662+
}
663+
}
664+
}
665+
666+
var root = new Object();
667+
create_tree(root, 3, 3);
668+
//DFS_recursive(root);
669+
//DFS_stack(root);
670+
BFS_queue(root);
671+
</script>
672+
</body>
673+
<html>
674+
```

0 commit comments

Comments
 (0)