Skip to content

Commit efa7638

Browse files
authored
Merge branch 'master' into patch-21
2 parents 02bbe86 + 6c73ab7 commit efa7638

7 files changed

Lines changed: 11 additions & 15 deletions

File tree

subjects/insertion_sort/README.md

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

55
Implement the insertion-sort algorithm by creating a function named `insertion_sort`. It should execute the iterations of the algorithm **up to** the number indicated by `steps`. See the **Usage** for more information.
66

7-
The insertion-sort algorithm sorts an array of size `n` in ascending order.
7+
The insertion-sort algorithm sorts an array of size `n` in ascending order.
88

99
1. Iterates over the slice from `slice[1]` to `slice[n]`.
1010

@@ -32,6 +32,8 @@ pub fn insertion_sort(slice: &mut [i32], steps: usize) {
3232
Here is a possible program to test your function,
3333

3434
```rust
35+
use insertion_sort::insertion_sort;
36+
3537
fn main() {
3638
let mut target = [5, 3, 7, 2, 1, 6, 8, 4];
3739
// executes the first iteration of the algorithm

subjects/insertion_sort/main.rs

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,5 @@
1+
use insertion_sort::insertion_sort;
2+
13
fn main() {
24
let mut target = [5, 3, 7, 2, 1, 6, 8, 4];
35
// executes the first iteration of the algorithm

subjects/inv_pyramid/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,7 @@ i = 5
2626
### Expected Functions
2727

2828
```rust
29-
fn inv_pyramid(v: String, i: u32) -> Vec<String> {}
29+
pub fn inv_pyramid(v: String, i: u32) -> Vec<String> {}
3030
```
3131

3232
### Usage
Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
public class ExerciseRunner {
22
public static void main(String[] args) {
3-
System.out.println(Singleton.get???().whoAreYou());
3+
System.out.println(Singleton.get???().ShowMessage());
44
}
55
}

subjects/java/checkpoints/singleton-blueprint/README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,7 @@ public class Singleton {
1616
public Singleton get???() {
1717
}
1818

19-
public String whoAreYou() {
19+
public String ShowMessage() {
2020
return "Hello, I am a singleton!"
2121
}
2222
}
@@ -29,7 +29,7 @@ Here is a possible `ExerciseRunner.java` to test your class:
2929
```java
3030
public class ExerciseRunner {
3131
public static void main(String[] args) {
32-
System.out.println(Singleton.get???().whoAreYou());
32+
System.out.println(Singleton.get???().ShowMessage());
3333
}
3434
}
3535
```

subjects/own_and_return/README.md

Lines changed: 1 addition & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -31,12 +31,8 @@ Here is a possible program to test your function:
3131
```rust
3232
use own_and_return::*;
3333

34-
pub struct Film {
35-
pub name: String,
36-
}
37-
3834
fn main() {
39-
let my_film = Film { name: "Terminator".toString() };
35+
let my_film = Film { name: "Terminator".to_string() };
4036
println!("{}", take_film_name(/* to be implemented */));
4137
// the order of the print statements is intentional, if your implementation is correct,
4238
// you should have a compile error because my_film was consumed

subjects/own_and_return/main.rs

Lines changed: 1 addition & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,12 +1,8 @@
11
use own_and_return::*;
22

3-
pub struct Film {
4-
pub name: String,
5-
}
6-
73
fn main() {
84
let my_film = Film {
9-
name: "Terminator".toString(),
5+
name: "Terminator".to_string(),
106
};
117
println!("{}", take_film_name(/* to be implemented */));
128
// the order of the print statements is intentional, if your implementation is correct,

0 commit comments

Comments
 (0)