Select Git revision
-
Md. Alim Ul Karim authoredResolve "LinkedList datastructure" Closes #18 ## Introduction Create new data structure LinkedList, add sorting, and fixing existing code issues/ Note: [Template Reference](https://hackmd.io/@akarimevatix/H1Qsmq23w) ## Worked on Items - [x] #18 - LinkedList ## TODOs - [ ] Create LinkedCollections each node will hold collection pointers - [ ] Add chain equal checking for nodes. ## References Sorting fixed - [Sorting using golang lib](https://play.golang.org/p/sJ8a464USeV) - [Pointer Strings Sort](https://play.golang.org/p/8V8YYdQrO6q) ## Notes - N/A ## Merge Request Ordering NA See merge request !23
Md. Alim Ul Karim authoredResolve "LinkedList datastructure" Closes #18 ## Introduction Create new data structure LinkedList, add sorting, and fixing existing code issues/ Note: [Template Reference](https://hackmd.io/@akarimevatix/H1Qsmq23w) ## Worked on Items - [x] #18 - LinkedList ## TODOs - [ ] Create LinkedCollections each node will hold collection pointers - [ ] Add chain equal checking for nodes. ## References Sorting fixed - [Sorting using golang lib](https://play.golang.org/p/sJ8a464USeV) - [Pointer Strings Sort](https://play.golang.org/p/8V8YYdQrO6q) ## Notes - N/A ## Merge Request Ordering NA See merge request !23
MinFloat32.go 129 B
package coremath
//goland:noinspection ALL
func MinFloat32(v1, v2 float32) float32 {
if v1 > v2 {
return v2
}
return v1
}