temp: save file

Author: obetame

README.md

@@ -2,9 +2,9 @@
 
 > 本项目还在施工中...
 
-所有排序使用的数据为(0, 10000)的`i32`类型数字.
+所有排序使用的数据为(0, 10000)的`i32`类型数字.如果你对于下面某些排序有疑问,可以去[www.cs.usfca.edu](https://www.cs.usfca.edu/~galles/visualization/ComparisonSort.html)以动画形式查看各种排序,非常简单易懂.
 
-## 冒泡
+## 冒泡排序
 
 实现了三种冒泡方式,每次都以上一次进行优化:
 
@@ -18,4 +18,10 @@ bubble1 take time PT6.687554709S
 bubble2 take time PT6.535498605S
 ```
 
-可见优化后差距并不大,总体都在6.5秒之间.但是数据量提升一个数量级后时间会增加很多,比如(0,100000)的数据量使用冒泡是非常久的.
+可见优化后差距并不大,总体都在6.5秒之间.但是数据量提升一个数量级后时间会增加很多,比如(0,100000)的数据量使用冒泡是非常久的.
+
+## 选择排序
+
+```
+select take time PT4.073199300S
+```

src/array.rs

@@ -1,7 +1,7 @@
 use rand::Rng;
 
 pub fn init() -> Vec<i32> {
- let n = 10000;
+ let n = 10;
  let mut array = Vec::new();
 
  let mut rng = rand::thread_rng();

src/bubble.rs

@@ -1,14 +1,18 @@
 use time::PreciseTime;
 
+fn swap(val: &mut Vec<i32>, a: usize, b: usize) {
+ val[a] = val[a] ^ val[b];
+ val[b] = val[a] ^ val[b];
+ val[a] = val[a] ^ val[b];
+}
+
 // 冒泡
 fn bubble(val: &Vec<i32>) -> Vec<i32> {
  let mut value = val.clone();
  for i in 0..value.len() {
  for m in 0..value.len() - 1 - i {
  if value[m] > value[m + 1] {
- let temp = value[m];
- value[m] = value[m + 1];
- value[m + 1] = temp;
+ swap(&mut value, m, m + 1);
  }
  }
  }
@@ -22,9 +26,7 @@ fn bubble1(val: &Vec<i32>) -> Vec<i32> {
  let mut flag = 0;
  for m in 0..value.len() - 1 - i {
  if value[m] > value[m + 1] {
- let temp = value[m];
- value[m] = value[m + 1];
- value[m + 1] = temp;
+ swap(&mut value, m, m + 1);
  flag = 1;
  }
  }
@@ -43,9 +45,7 @@ fn bubble2(val: &Vec<i32>) -> Vec<i32> {
  let mut flag = 0;
  for m in 0..last_change {
  if value[m] > value[m + 1] {
- let temp = value[m];
- value[m] = value[m + 1];
- value[m + 1] = temp;
+ swap(&mut value, m, m + 1);
  flag = 1;
  last_change = m + 1;
  }

src/main.rs

@@ -1,18 +1,23 @@
+use std::env;
+
 extern crate time;
 extern crate rand;
 
 mod array;
 mod bubble;
-
-// 选择
-//fn select(val: &Vec<i32>) -> Vec<i32> {
-//
-//}
+mod select;
 
 fn main() {
- let array_value: Vec<i32> = array::init();
+ if let Some(name) = env::args().nth(1) {
+// let array_value: Vec<i32> = array::init();
+ let array_value = vec![0, 5, 4, 1, 8, 0, 7, 0, 2, 3];
 
- bubble::test(&array_value);
+ match name.as_ref() {
+ "bubble" => bubble::test(&array_value),
+ "select" => select::test(&array_value),
+ _ => println!("please input sort name")
+ }
+ }
 }
 
 

src/select.rs

@@ -0,0 +1,89 @@
+use time::PreciseTime;
+
+fn swap(val: &mut Vec<i32>, a: usize, b: usize) {
+ val[a] = val[a] ^ val[b];
+ val[b] = val[a] ^ val[b];
+ val[a] = val[a] ^ val[b];
+}
+
+// 选择
+fn select(val: &Vec<i32>) -> Vec<i32> {
+ let mut value = val.clone();
+ for i in 0..value.len() - 1 {
+ let mut min = i;
+ for n in i+1..value.len() {
+ if value[n] < value[min] {
+ min = n;
+ }
+ }
+ if min != i {
+ swap(&mut value, min, i);
+ }
+ }
+ value
+}
+
+// 优化1
+fn select1(val: &Vec<i32>) -> Vec<i32> {
+ let mut value = val.clone();
+ let mut left = 0;
+ let mut right = value.len() - 1;
+
+ while left < right {
+ let mut min = left;
+ let mut max = right;
+
+ for n in left..right+1 { // 需要循环到right下标,因此需要加1
+ if value[min] > value[n] {
+ min = n;
+ }
+ if value[max] < value[n] {
+ max = n;
+ }
+ }
+ println!("min: {}, max: {}, left: {}, right: {}", min, max, left, right);
+ println!("min value: {}, max value: {}", value[min], value[max]);
+
+ if min == right && max == left {
+ swap(&mut value, left, right);
+ } else {
+ if min != left {
+// if min == right {
+// right =
+// }
+ swap(&mut value, min, left);
+ }
+ if max != right {
+ swap(&mut value, if max == left { min } else { max }, right);
+ }
+ }
+// if value[min] < value[left] && min != left {
+// swap(&mut value, min, left);
+// }
+// if value[max] > value[right] && max != right {
+// swap(&mut value, max, right);
+// }
+ println!("{:?}", value);
+ left+=1;
+ right-=1;
+ }
+ value
+}
+
+pub fn test(array_value: &Vec<i32>) {
+ println!("Start test select sort:{:?}", array_value);
+
+ let start_select = PreciseTime::now();
+ let a = select(&array_value);
+ let end_select = PreciseTime::now();
+ println!("select take time {}", start_select.to(end_select));
+
+ let start_select = PreciseTime::now();
+ let b = select1(&array_value);
+ let end_select = PreciseTime::now();
+ println!("select1 take time {}", start_select.to(end_select));
+
+ println!("{:?}", a);
+ println!("{:?}", b);
+ println!("{}", a == b);
+}